Perfect codes in the graphs \(O_k\)

DOI10.1016/0095-8956(75)90087-8zbMath0282.94007OpenAlexW2030895591MaRDI QIDQ1844190

Yanyan Li

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90087-8

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph theory (05C99) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (16)

Weighted efficient domination problem on some perfect graphs ⋮ Efficient domination through eigenvalues ⋮ Total perfect codes in Cayley graphs ⋮ Structure of squares and efficient domination in graph classes ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ On non-normal subgroup perfect codes ⋮ Perfect codes in vertex-transitive graphs ⋮ Perfect Codes in Cayley Graphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ On subgroup perfect codes in Cayley graphs ⋮ The covering radius of Hadamard codes in odd graphs ⋮ An improved version of Lloyd's theorem ⋮ Nearly perfect codes in distance-regular graphs ⋮ Perfect codes in the graphs O_k and L(O_k) ⋮ Fundamentals of coding type problems ⋮ Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs

Cites Work

• Perfect codes in graphs
• Coding theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect codes in the graphs \(O_k\)