作者: Janja Jerebic , Sandi Klavžar , Simon Špacapan
DOI: 10.1016/J.IPL.2004.12.010
关键词:
摘要: An r-perfect code of a graph G = (V, E) is set C ⊆ V such that the r-balls centered at vertices form partition V. It proved direct product Cm and Cn (r ≥ 1, m, n 2r + 1) contains an if only m are each multiple 1)2 r2 Cm, Cn, Cl n, l r3 1)3. The corresponding r-codes essentially unique. Also, codes in C2r × 2, 2r) characterized.