Equitable 2-partitions of the Hamming graphs with the second eigenvalue

DOI10.1016/j.disc.2020.112039zbMath1447.05174arXiv1903.12333OpenAlexW3039593901MaRDI QIDQ2198380

Alexandr Valyuzhenich, Ivan Yu. Mogilnykh

Publication date: 10 September 2020

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

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

zbMATH Keywords

Hamming graphcompletely regular codeequitable partitioneigenvalue technique

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Minimum supports of eigenfunctions of graphs: a survey ⋮ Completely regular codes in Johnson and Grassmann graphs with small covering radii ⋮ Subgroup regular sets in Cayley graphs ⋮ On completely regular codes with minimum eigenvalue in geometric graphs ⋮ Perfect 2‐colorings of Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum supports of eigenfunctions of Hamming graphs
• On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
• On perfect colorings of Boolean \(n\)-cube and correlation immune functions with small density
• On nonsystematic perfect binary codes.
• Completely regular designs of strength one
• Minimum supports of functions on the Hamming graphs with spectral constraints
• Tactical decompositions and orbits of projective groups
• Cycle-balance conditions for distance-regular graphs
• On unbalanced Boolean functions with best correlation immunity
• A bound on correlation immunity
• Perfect colorings of the 12-cube that attain the bound on correlation immunity
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• On completely regular codes

This page was built for publication: Equitable 2-partitions of the Hamming graphs with the second eigenvalue