pith. sign in

arxiv: 1706.03987 · v1 · pith:MWW2ROHRnew · submitted 2017-06-13 · 🧮 math.CO

Minimum supports of eigenfunctions of Johnson graphs

classification 🧮 math.CO
keywords eigenvectorsgraphsjohnsonattainboundcharacterizationeigenfunctionseigenvalue
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.