Distance-regular graphs admitting a perfect 1-code

DOI10.1016/j.disc.2021.112787zbMath1484.05207OpenAlexW4206307665MaRDI QIDQ2113339

Mojtaba Jazaeri

Publication date: 14 March 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112787

zbMATH Keywords

distance-regular graphperfect 1-code

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Combinatorial codes (94B25)

Related Items (1)

On the order of antipodal covers

Uses Software

• GAP
• FinInG

Cites Work

• Unnamed Item
• Extremal 1-codes in distance-regular graphs of diameter 3
• The uniqueness of a generalized hexagon of order 3 containing a subhexagon of order \((1,3)\)
• Perfect codes over graphs
• On generalized hexagons and a near octagon whose lines have three points
• Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
• Efficient domination in Cayley graphs of generalized dihedral groups
• The Sylvester graph and Moore graphs
• Perfect codes in graphs
• Distance-regular Cayley graphs with small valency

This page was built for publication: Distance-regular graphs admitting a perfect 1-code