Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.disc.2020.112039 | Discrete Mathematics |
Keywords | DocType | Volume |
Equitable partition,Completely regular code,Hamming graph,Eigenvalue technique | Journal | 343 |
Issue | ISSN | Citations |
11 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Yu. Mogilnykh | 1 | 36 | 8.74 |
| Alexandr Valyuzhenich | 2 | 16 | 3.37 |