Connected graphs with large multiplicity of $-1$ in the spectrum of the eccentricity matrix
Xinghui Zhao, Lihua You

TL;DR
This paper characterizes connected graphs with a large multiplicity of the eigenvalue -1 in the spectrum of their eccentricity matrix, expanding understanding of spectral properties related to graph structure.
Contribution
It provides a complete characterization of connected graphs with high multiplicity of -1 as an eigenvalue in the eccentricity matrix spectrum for multiplicities up to five.
Findings
Identifies specific graph classes with eigenvalue -1 multiplicity n-i for i ≤ 5.
Connects spectral properties to the median eigenvalue problem.
Enhances understanding of eccentricity matrix spectra in graph theory.
Abstract
The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining entries become zero. This matrix is also called the anti-adjacency matrix, since the adjacency matrix can also be obtained from the distance matrix but this time by keeping only the entries equal to . It is known that, for and a fixed , there is only a finite number of graphs with vertices having as an eigenvalue of multiplicity on the spectrum of the adjacency matrix. This phenomenon motivates researchers to consider the graphs has a large multiplicity of an eigenvalue in the spectrum of the eccentricity matrix, for example, the eigenvalue [X. Gao, Z. Stani\'{c}, J.F. Wang, Grahps with large multiplicity of in the spectrum of 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
TopicsMatrix Theory and Algorithms · Graph theory and applications · graph theory and CDMA systems
