Equitable 2-partitions of the Hamming graphs with the second eigenvalue
Combinatorics
2019-04-01 v1
Abstract
The eigenvalues of the Hamming graph are known to be , . The characterization of equitable 2-partitions of the Hamming graphs with eigenvalue was obtained by Meyerowitz in [15]. We study the equitable 2-partitions of with eigenvalue . We show that these partitions are reduced to equitable 2-partitions of with eigenvalue with exception of two constructions.
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}
}