Minimum supports of eigenfunctions of Johnson graphs
Combinatorics
2017-06-14 v1
Abstract
We study the weights of eigenvectors of the Johnson graphs . For any and sufficiently large we show that an eigenvector of with the eigenvalue has at least nonzeros and obtain a characterization of eigenvectors that attain the bound.
Cite
@article{arxiv.1706.03987,
title = {Minimum supports of eigenfunctions of Johnson graphs},
author = {Konstantin Vorob'ev and Ivan Mogilnykh and Alexandr Valyuzhenich},
journal= {arXiv preprint arXiv:1706.03987},
year = {2017}
}