Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank using a new approach
Ahmet Batal

TL;DR
This paper establishes new bounds on the eigenvalue multiplicities of various graph matrices based on the circuit rank, generalizing previous results and applying to a broader class of graphs and eigenvalues.
Contribution
It introduces bounds on eigenvalue multiplicities in terms of circuit rank that are tighter and more general than previous bounds, applicable to multiple graph matrices and eigenvalues.
Findings
Bounds depend only on circuit rank, not multiples of it.
Generalizes previous results to all even eigenvalues of various matrices.
Extends bounds to rational eigenvalues and generalized adjacency matrices.
Abstract
Let be a simple undirected graph, be the circuit rank of , and be the nullity and the multiplicity of eigenvalue of a graph matrix , respectively. In the case is the adjacency matrix , (the Laplacian matrix , the signless Laplacian matrix ) we find bounds to in terms of when is an integer (even integer, respectively). We also show that when and are rational numbers similar bounds can be found for where is the generalized adjaceny matrix of . Our bounds contain only , not a multiple of it. Up to now only bounds of (and later ) have been found in terms of the circuit rank and all of them contains . There is only one exception in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Synthesis and Properties of Aromatic Compounds
