Solving Two Conjectures regarding Codes for Location in Circulant Graphs
暂无分享,去创建一个
[1] Nathalie Bertrand,et al. Identifying and locating-dominating codes on chains and cycles , 2004, Eur. J. Comb..
[2] Paul D. Manuel. Locating and Liar Domination of Circulant Networks , 2011, Ars Comb..
[3] Peter J. Slater,et al. Fault-tolerant locating-dominating sets , 2002, Discret. Math..
[4] Changhong Lu,et al. Identifying codes and locating-dominating sets on paths and cycles , 2011, Discret. Appl. Math..
[5] Ludovít Niepel,et al. Locating and identifying codes in circulant networks , 2013, Discret. Appl. Math..
[6] Peter J. Slater. Domination and location in acyclic graphs , 1987, Networks.
[7] Tero Laihonen,et al. Locating-dominating codes in cycles , 2011, Australas. J Comb..
[8] Sylvain Gravier,et al. Identifying codes of cycles , 2006, Eur. J. Comb..
[9] David L. Roberts,et al. Locating sensors in paths and cycles: The case of 2-identifying codes , 2008, Eur. J. Comb..
[10] Tero Laihonen,et al. Optimal Identifying Codes in Cycles and Paths , 2012, Graphs Comb..
[11] Tero Laihonen,et al. Optimal bounds on codes for location in circulant graphs , 2018, Cryptography and Communications.
[12] Xiao-Dong Hu,et al. Identifying codes of cycles with odd orders , 2008, Eur. J. Comb..
[13] Mark G. Karpovsky,et al. On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.