The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph
Combinatorics
2016-07-06 v2
Abstract
For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and an upper bound for M(G) respectively, and we show that these bounds are sharp.
Keywords
Cite
@article{arxiv.1601.02760,
title = {The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph},
author = {Keivan Hassani Monfared and Sudipta Mallik},
journal= {arXiv preprint arXiv:1601.02760},
year = {2016}
}
Comments
15 pages, 6 figures