On completely regular codes with minimum eigenvalue in geometric graphs

DOI10.1016/j.disc.2023.113357zbMath1518.05050arXiv2210.11184MaRDI QIDQ6041848

Konstantin Vorob'ev, Ivan Yu. Mogilnykh

Publication date: 15 May 2023

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

Full work available at URL: https://arxiv.org/abs/2210.11184

zbMATH Keywords

Johnson graph\(t\)-designreconstructiongeometric graphDelsarte cliquecompletely regular code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other designs, configurations (05B30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely regular clique graphs
• Induced perfect colorings
• To the theory of \(q\)-ary Steiner and other-type trades
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• Completely regular designs of strength one
• Boolean degree 1 functions on some classical association schemes
• Cycle-balance conditions for distance-regular graphs
• Completely regular codes in Johnson and Grassmann graphs with small covering radii
• Equitable 2-partitions of the Hamming graphs with the second eigenvalue
• Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
• Completely regular designs
• On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
• On completely regular codes

This page was built for publication: On completely regular codes with minimum eigenvalue in geometric graphs