Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
From MaRDI portal
Publication:2259279
DOI10.1016/j.laa.2015.01.034zbMath1307.05145OpenAlexW2068986178WikidataQ123151081 ScholiaQ123151081MaRDI QIDQ2259279
Publication date: 27 February 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.01.034
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (3)
On the second largest distance eigenvalue of a block graph ⋮ Quadratic embedding constants of graph joins ⋮ On the sum of \(k\) largest distance eigenvalues of graphs
Uses Software
Cites Work
- On the distance spectral radius of some graphs
- On the distance matrix of a tree
- On distance matrices and Laplacians
- Distance spectra of graphs: a survey
- Complete multipartite graphs are determined by their distance spectra
- Bounds on graph eigenvalues. II
- On the distance spectrum of graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles