arXiv:1706.03987 [math.CO]AbstractReferencesReviewsResources
Minimum supports of eigenfunctions of Johnson graphs
Konstantin Vorob'ev, Ivan Mogilnykh, Alexandr Valyuzhenich
Published 2017-06-13Version 1
We study the weights of eigenvectors of the Johnson graphs $J(n,w)$. For any $i \in \{1,\ldots,w\}$ and sufficiently large $n, n\geq n(i,w)$ we show that an eigenvector of $J(n,w)$ with the eigenvalue $\lambda_i=(n-w-i)(w-i)-i$ has at least $2^i(^{n-2i}_{w-i})$ nonzeros and obtain a characterization of eigenvectors that attain the bound.
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2102.11142 [math.CO] (Published 2021-02-22)
Minimum supports of eigenfunctions of graphs: a survey
arXiv:0712.1622 [math.CO] (Published 2007-12-11)
Primitive decompositions of Johnson graphs
arXiv:2403.15645 [math.CO] (Published 2024-03-22)
Mutual-visibility problems in Kneser and Johnson graphs