×

Perfect codes in regular graphs. (English) Zbl 0691.05054

Summary: We prove that for any finite set M of positive integers and for any graph G with maximum degree d, G is an introduced subgraph of a \((d+1)\)-regular graph containing t-perfect codes for every \(t\in M\).

MSC:

05C99 Graph theory
94B25 Combinatorial codes
PDFBibTeX XMLCite