Graphs whose distance matrix has at most three negative eigenvalues

DOI10.1016/J.LAA.2017.05.040zbMATH Open1367.05137OpenAlexW2616924506MaRDI QIDQ2013202FDOQ2013202

Authors: Fenglei Tian, Dein Wong 

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

Recommendations

• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• On graphs with at least three distance eigenvalues less than \(-1\)
• Graphs with three distinct distance eigenvalues
• scientific article; zbMATH DE number 4041958
• On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
• Some graphs with exactly three non-negative eigenvalues
• Graphs with least eigenvalue at least \(-\sqrt3\)
• Distance-regular graphs of diameter 3 having eigenvalue \(-1\)
• Distance-regular graphs the distance matrix of which has only one positive eigenvalue
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)

zbMATH Keywords

distance matrix\(D\)-eigenvaluenegative inertia

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Determination of the inertia of a partitioned Hermitian matrix
• Distance spectra of graphs: a survey
• On the Addressing Problem for Loop Switching
• Recent results in the theory of graph spectra
• The Gewirtz graph: An exercise in the theory of graph spectra
• A characterization of graphs with rank 4
• On graphs with a fixed number of negative eigenvalues
• Graphs with Exactly Two Negative Eigenvalues
• On distance matrices and Laplacians
• Positive and negative inertia index of a graph
• The distance matrices of some graphs related to wheel graphs
• Distance spectra and distance energies of iterated line graphs of regular graphs
• The inertia of distance matrices of some graphs
• The inertia and energy of distance matrices of complete \(k\)-partite graphs
• The inertia and energy of the distance matrix of a connected graph
• On the nullity of graphs
• The positive and the negative inertia index of line graphs of trees

Cited In (6)

• The inertia and energy of the distance matrix of a connected graph
• A short note on a short remark of Graham and Lovász
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• The distance matrices of some graphs related to wheel graphs
• On graphs with at least three distance eigenvalues less than \(-1\)
• An exploration of graphs with extreme negative inertia index

This page was built for publication: Graphs whose distance matrix has at most three negative eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013202)