Extremal cardinalities for identifying and locating-dominating codes in graphs-Reference-Cited by-同舟云学术

Extremal cardinalities for identifying and locating-dominating codes in graphs

Published:2007-02 Issue:3-5 Volume:307 Page:356-366
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Charon Irène,Hudry Olivier,Lobstein Antoine

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference10 articles.

1. N. Bertrand, Codes identifiants et codes localisateurs-dominateurs sur certains graphes, Mémoire de stage de maıˆtrise (under O. Hudry's supervision), ENST, Paris, France, June 2001.

2. Identifying codes with small radius in some infinite regular graphs;Charon;Electron. J. Combin.,2002

3. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard;Charon;Theoret. Comput. Sci.,2003

4. Possible cardinalities for identifying codes in graphs;Charon;Australas. J. Combin.,2005

5. Possible cardinalities for locating-dominating codes in graphs;Charon;Australas. J. Combin.,2006

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bounds and Extremal Graphs for Total Dominating Identifying Codes;The Electronic Journal of Combinatorics;2023-07-28

2. On the binary locating-domination number of regular and strongly-regular graphs;Journal of Mathematical Inequalities;2023

3. On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs;Mathematics;2022-05-25

4. Minimum identifying codes in some graphs differing by matchings;Discrete Mathematics, Algorithms and Applications;2020-05-07

5. The compared costs of domination, location-domination and identification;Discussiones Mathematicae Graph Theory;2020