Abstract
In this paper, we continue the study of identifying codes in graphs, introduced by Karpovsky et al. (IEEE Trans Inf Theory 44:599–611, 1998). A subset S of vertices in a graph G is an identifying code if for every pair of vertices x and y of G, the sets \(N[x]\cap S\) and \(N[y]\cap S\) are non-empty and different. The minimum cardinality of an identifying code in G is denoted by M(G). We show that for a tree T with \(n\ge 3\) vertices, \(\ell \) leaves and s support vertices, \((2n-s+3)/4\le M(T) \le (3n+2\ell -1)/5\). Moreover, we characterize all trees achieving equality for these bounds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balbuena, C., Foucaud, F., Hansberg, A.: Locating-dominating sets and identifying codes in graphs of girth at least 5. Electron. J. Combin. 22(2), P2.15 (2015)
Bertrand, N., Charon, I., Hudry, O., Lobstein, A.: Identifying and locating-dominating codes on chains and cycles. Eur. J. Combin. 25, 969–987 (2004)
Blidia, M., Chellali, M., Maffray, F., Moncel, J., Semri, A.: Locating-domination and identifying codes in trees. Australas. J. Combin. 39, 219–232 (2007)
Chellali, M.: On locating and differentiating-total domination in trees. Discuss. Math. Graph Theory 28, 383–392 (2008)
Chen, X.-G., Sohn, M.Y.: Bounds on the locating-total domination number of a tree. Discrete Appl. Math. 159, 769–773 (2011)
Foucaud, F., Henning, M.A.: Location-domination in line graphs. Discrete Math. 340, 3140–3153 (2017)
Foucaud, F., Perarnau, G.: Bounds for identifying codes in terms of degree parameters. Electron. J. Combin. 19(1), P32 (2012)
Foucaud, F., Klasing, R., Kosowski, A., Raspaud, A.: On the size of identifying codes in triangle-free graphs. Discrete Appl. Math. 160, 1532–1546 (2012)
Foucaud, F., Gravier, S., Naserasr, R., Parreau, A., Valicov, P.: Identifying codes in line graphs. J. Graph Theory 73, 425–448 (2013)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Haynes, T.W., Henning, M.A., Howard, J.: Locating and total dominating sets in trees. Discrete Appl. Math. 154, 1293–1300 (2006)
Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44, 599–611 (1998)
Ning, W., Lu, M., Guo, J.: Bounds on the differentiating-total domination number of a tree. Discrete Appl. Math. 200, 153–160 (2016)
Acknowledgements
The authors would like to thank both referees for their careful review and many helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Rahbani, H., Rad, N.J. & MirRezaei, S.M. Bounds on the Identifying Codes in Trees. Graphs and Combinatorics 35, 599–609 (2019). https://doi.org/10.1007/s00373-019-02018-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-019-02018-1