The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph

Authors

Keivan Hassani Monfared
Sudipta Mallik, Marshall UniversityFollow

Document Type

Article

Publication Date

1-2016

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.

Comments

© 2016 The Authors. Available from arXiv at https://doi.org/10.48550/arXiv.1601.02760

Recommended Citation

Hassani Monfared, K., & Mallik, S. (2016). The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph. arXiv e-prints, arXiv-1601.