The graphs G that both G and L(G) contain 1-perfect codes

zbMATH Open1255.05062MaRDI QIDQ4897782FDOQ4897782

Authors:

Publication date: 28 December 2012

Full work available at URL: http://www.m-hikari.com/imf/imf-2012/41-44-2012/index.html

Recommendations

• scientific article
• Publication:4207865
• Perfect codes over graphs
• scientific article; zbMATH DE number 3922532
• scientific article; zbMATH DE number 169589

zbMATH Keywords

line graphperfect code

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

This page was built for publication: The graphs \(G\) that both \(G\) and \(L(G)\) contain 1-perfect codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4897782)