English

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

Combinatorics 2019-04-01 v1

Abstract

The eigenvalues of the Hamming graph H(n,q)H(n,q) are known to be λi(n,q)=(q1)nqi\lambda_i(n,q)=(q-1)n-qi, 0in0\leq i \leq n. The characterization of equitable 2-partitions of the Hamming graphs H(n,q)H(n,q) with eigenvalue λ1(n,q)\lambda_{1}(n,q) was obtained by Meyerowitz in [15]. We study the equitable 2-partitions of H(n,q)H(n,q) with eigenvalue λ2(n,q)\lambda_{2}(n,q). We show that these partitions are reduced to equitable 2-partitions of H(3,q)H(3,q) with eigenvalue λ2(3,q)\lambda_{2}(3,q) with exception of two constructions.

Keywords

Cite

@article{arxiv.1903.12333,
  title  = {Equitable 2-partitions of the Hamming graphs with the second eigenvalue},
  author = {Ivan Mogilnykh and Alexandr Valyuzhenich},
  journal= {arXiv preprint arXiv:1903.12333},
  year   = {2019}
}
R2 v1 2026-06-23T08:22:51.495Z