Distance-regular graphs admitting a perfect 1-code
From MaRDI portal
Publication:2113339
DOI10.1016/J.DISC.2021.112787zbMATH Open1484.05207OpenAlexW4206307665MaRDI QIDQ2113339FDOQ2113339
Authors: 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
Recommendations
- Classification of a class of distance-regular graphs via completely regular codes
- Publication:3032308
- Extremal 1-codes in distance-regular graphs of diameter 3
- An algebraic characterization of completely regular codes in distance-regular graphs
- Yet another distance regular graph related to a Golay code
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- scientific article; zbMATH DE number 4104861
- 1-perfect codes in Sierpiński graphs
- Codes in Shilla distance-regular graphs
- Perfect codes in graphs
Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Combinatorial codes (94B25)
Cites Work
- Title not available (Why is that?)
- Perfect codes in graphs
- On generalized hexagons and a near octagon whose lines have three points
- Perfect codes over graphs
- The uniqueness of a generalized hexagon of order 3 containing a subhexagon of order \((1,3)\)
- Extremal 1-codes in distance-regular graphs of diameter 3
- The Sylvester graph and Moore graphs
- Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
- Efficient domination in Cayley graphs of generalized dihedral groups
- Distance-regular Cayley graphs with small valency
Cited In (4)
Uses Software
This page was built for publication: Distance-regular graphs admitting a perfect 1-code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113339)
