论文信息 - Perfect r-Codes in Strong Products of Graphs

Perfect r-Codes in Strong Products of Graphs

A perfect r-code in a graph is a subset of the graph’s vertices with the property that each vertex in the graph is within distance r of exactly one vertex in the subset. We prove that the n-fold strong product of simple graphs has a perfect r-code if and only if each factor has a perfect r-code.

Ghidewon Abay-Asmerom | Dewey T. Taylor | Richard H. Hammack

[1] Karel A. Post. Nonexistence Theorems on Perfect Lee Codes over Large Alphabets , 1975, Inf. Control..

[2] Sylvain Gravier,et al. On the Non-existence of 3-Dimensional Tiling in the Lee Metric , 1998, Eur. J. Comb..

[3] P. Cull,et al. Perfect codes on graphs , 1997, Proceedings of IEEE International Symposium on Information Theory.

[4] Janez Zerovnik,et al. Perfect codes in direct products of cycles - a complete characterization , 2008, Adv. Appl. Math..

[5] Sandi Klavzar,et al. Characterizing r-perfect codes in direct products of two and three cycles , 2005, Inf. Process. Lett..

[6] Sandi Klavzar,et al. An almost complete description of perfect codes in direct products of cycles , 2006, Adv. Appl. Math..

[7] Hsing-Lung Chen,et al. Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes , 1994, IEEE Trans. Computers.

[8] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .

[9] Hee Yong Youn,et al. Processor Scheduling and Allocation for 3D Torus Multicomputer Systems , 2000, IEEE Trans. Parallel Distributed Syst..

[10] P. K. Jha. Perfect r-domination in the Kronecker product of three cycles , 2002 .

[11] S. Golomb,et al. Perfect Codes in the Lee Metric and the Packing of Polyominoes , 1970 .

[12] Simon Špacapan,et al. Nonexistence of face-to-face four-dimensional tilings in the Lee metric , 2007, Eur. J. Comb..