Minimum supports of eigenfunctions of Hamming graphs
From MaRDI portal
Publication:512596
DOI10.1016/J.DISC.2016.09.018zbMath1357.05094arXiv1512.02606OpenAlexW2963384356MaRDI QIDQ512596
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02606
Related Items (15)
Minimum supports of eigenfunctions of graphs: a survey ⋮ Minimum supports of eigenfunctions of Johnson graphs ⋮ On eigenfunctions and maximal cliques of Paley graphs of square order ⋮ Minimum supports of eigenfunctions in bilinear forms graphs ⋮ Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs ⋮ On the minimum supports of some eigenfunctions in the Doob graphs ⋮ Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph ⋮ Equitable 2-partitions of the Hamming graphs with the second eigenvalue ⋮ Optimal functions with spectral constraints in hypercubes ⋮ Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph ⋮ Algebraic properties of perfect structures ⋮ Minimum supports of functions on the Hamming graphs with spectral constraints ⋮ On existence of perfect bitrades in Hamming graphs ⋮ \(PI\)-eigenfunctions of the Star graphs ⋮ The EKR-module property of pseudo-Paley graphs of square order
Cites Work
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- To the theory of \(q\)-ary Steiner and other-type trades
- On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\)
- On the structure of non-full-rank perfect \(q\)-ary codes
- On the number of n-ary quasigroups of finite order
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- On the number of inequivalent steiner triple systems
This page was built for publication: Minimum supports of eigenfunctions of Hamming graphs
