3 research outputs found

    Sufficient conditions for a digraph to admit a (1,=l)-identifying code

    Get PDF
    A (1, = `)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ` have distinct closed in-neighbourhoods within C. In this paper, we give some sufficient conditions for a digraph of minimum in-degree d - = 1 to admit a (1, = `)- identifying code for ` ¿ {d -, d- + 1}. As a corollary, we obtain the result by Laihonen that states that a graph of minimum degree d = 2 and girth at least 7 admits a (1, = d)-identifying code. Moreover, we prove that every 1-in-regular digraph has a (1, = 2)-identifying code if and only if the girth of the digraph is at least 5. We also characterize all the 2-in-regular digraphs admitting a (1, = `)-identifying code for ` ¿ {2, 3}.Peer ReviewedPostprint (author's final draft

    Characterizing identifying codes from the spectrum of a graph or digraph

    Get PDF
    A -identifying code in digraph D is a dominating subset C of vertices of D, such that all distinct subsets of vertices of D with cardinality at most l have distinct closed in-neighborhoods within C. As far as we know, it is the very first time that the spectral graph theory has been applied to the identifying codes. We give a new method to obtain an upper bound on l for digraphs. The results obtained here can also be applied to graphs.Peer ReviewedPostprint (author's final draft
    corecore