Sciact
  • EN
  • RU

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

Journal Discrete Mathematics
ISSN: 0012-365X , E-ISSN: 1872-681X
Output data Year: 2020, Volume: 343, Article number : 112039, Pages count : 9 DOI: 10.1016/j.disc.2020.112039
Tags Совершенная раскраска, полностью регулярный код, граф Хэмминга, спектр
Authors Mogilnykh Ivan 1,2 , Valyuzhenich Alexandr 1,2
Affiliations
1 Sobolev Institute of mathematics
2 Novosibirsk State University

Abstract: The eigenvalues of the Hamming graph H(n, q) are known to be λi(n, q) = (q−1)n−qi, 0 ≤ i ≤ n. The characterization of equitable 2-partitions of the Hamming graphs H(n, q) with eigenvalue λ1(n, q) was obtained by Meyerowitz (2003). We study the equitable 2-partitions of H(n, q) with eigenvalue λ2(n, q). We show that these partitions are reduced to equitable 2-partitions of H(3, q) with eigenvalue λ2(3, q) with the exception of two constructions.
Cite: Mogilnykh I. , Valyuzhenich A.
Equitable 2-partitions of the Hamming graphs with the second eigenvalue
Discrete Mathematics. 2020. V.343. 112039 :1-9. DOI: 10.1016/j.disc.2020.112039 WOS Scopus РИНЦ OpenAlex
Dates:
Accepted: Jun 19, 20
Submitted: Mar 29, 2019
Identifiers:
Web of science: WOS:000570249300004
Scopus: 2-s2.0-85087151789
Elibrary: 43303925
OpenAlex: W3039593901
Citing:
DB Citing
OpenAlex 12
Web of science 7
Scopus 11
Elibrary 4
Altmetrics: