arXiv:1903.12333 [math.CO]AbstractReferencesReviewsResources
Equitable 2-partitions of the Hamming graphs with the second eigenvalue
Ivan Mogilnykh, Alexandr Valyuzhenich
Published 2019-03-29Version 1
The eigenvalues of the Hamming graph $H(n,q)$ are known to be $\lambda_i(n,q)=(q-1)n-qi$, $0\leq i \leq n$. The characterization of equitable 2-partitions of the Hamming graphs $H(n,q)$ with eigenvalue $\lambda_{1}(n,q)$ was obtained by Meyerowitz in [15]. We study the equitable 2-partitions of $H(n,q)$ with eigenvalue $\lambda_{2}(n,q)$. We show that these partitions are reduced to equitable 2-partitions of $H(3,q)$ with eigenvalue $\lambda_{2}(3,q)$ with exception of two constructions.
Related articles: Most relevant | Search more
arXiv:0812.2300 [math.CO] (Published 2008-12-12)
A characterization of well-founded algebraic lattices
arXiv:math/0212139 [math.CO] (Published 2002-12-10)
Characterization of SDP Designs That Yield Certain Spin Models
arXiv:1702.05873 [math.CO] (Published 2017-02-20)
Characterization of 1-Tough Graphs using Factors