论文信息 - An optimal locating-dominating set in the infinite triangular grid

An optimal locating-dominating set in the infinite triangular grid

Assume that G=(V,E) is an undirected graph, and C@?V. For every v@?V, we denote by I(v) the set of all elements of C that are within distance one from v. If all the sets I(v) for v@?V@?C are non-empty, and pairwise different, then C is called a locating-dominating set. The smallest possible density of a locating-dominating set in the infinite triangular grid is shown to be 1357.

Iiro S. Honkala | I. Honkala

[1] IIRO HONKALA,et al. On identifying codes in the triangular and square grids , 2004, SIAM J. Comput..

[2] Mark G. Karpovsky,et al. On robust and dynamic identifying codes , 2006, IEEE Transactions on Information Theory.

[3] Antoine Lobstein,et al. Identifying and locating-dominating codes: NP-Completeness results for directed graphs , 2002, IEEE Trans. Inf. Theory.

[4] Iiro Honkala,et al. An Optimal Edge-Robust Identifying Code in the Triangular Lattice , 2004 .

[5] Mark G. Karpovsky,et al. On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.

[6] Peter J. Slater,et al. Fault-tolerant locating-dominating sets , 2002, Discret. Math..

[7] Antoine Lobstein,et al. Identifying Codes with Small Radius in Some Infinite Regular Graphs , 2002, Electron. J. Comb..

[8] Iiro S. Honkala,et al. General Bounds for Identifying Codes in Some Infinite Regular Graphs , 2001, Electron. J. Comb..

[9] Antoine Lobstein,et al. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard , 2003, Theor. Comput. Sci..

[10] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[11] Nathalie Bertrand,et al. Identifying and locating-dominating codes on chains and cycles , 2004, Eur. J. Comb..