Graphs whose distance matrix has at most three negative eigenvalues
From MaRDI portal
Publication:2013202
DOI10.1016/j.laa.2017.05.040zbMath1367.05137OpenAlexW2616924506MaRDI QIDQ2013202
Publication date: 3 August 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.05.040
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- The distance matrices of some graphs related to wheel graphs
- The inertia of distance matrices of some graphs
- The inertia and energy of the distance matrix of a connected graph
- A characterization of graphs with rank 4
- On graphs with a fixed number of negative eigenvalues
- Recent results in the theory of graph spectra
- The Gewirtz graph: An exercise in the theory of graph spectra
- On distance matrices and Laplacians
- Positive and negative inertia index of a graph
- Distance spectra of graphs: a survey
- The positive and the negative inertia index of line graphs of trees
- The inertia and energy of distance matrices of complete \(k\)-partite graphs
- Determination of the inertia of a partitioned Hermitian matrix
- On the nullity of graphs
- Distance spectra and distance energies of iterated line graphs of regular graphs
- Graphs with Exactly Two Negative Eigenvalues
- On the Addressing Problem for Loop Switching