An upper bound for higher order eigenvalues of symmetric graphs
Combinatorics
2020-06-16 v1
Abstract
In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.
Cite
@article{arxiv.2006.07632,
title = {An upper bound for higher order eigenvalues of symmetric graphs},
author = {Shinichiro Kobayashi},
journal= {arXiv preprint arXiv:2006.07632},
year = {2020}
}
Comments
12 pages