The inertia and energy of the distance matrix of a connected graph
From MaRDI portal
Publication:477743
DOI10.1016/j.laa.2014.10.045zbMath1304.05093MaRDI QIDQ477743
Huiqiu Lin, Xi-wen Lu, Rui-fang Liu
Publication date: 9 December 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.10.045
Related Items
The multiplicity of -2 as an eigenvalue of the distance matrix of graphs, Eccentricity spectral radius of \(t\)-clique trees with given diameter, Extremal Laplacian energy of threshold graphs, The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\), Graph families with constant distance determinant, On the distance spectra of threshold graphs, Inertia and distance energy of line graphs of unicyclic graphs, Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs, Graphs whose distance matrix has at most three negative eigenvalues, Effects on distance energy of complete bipartite graphs by embedding edges, The distance energy of clique trees, On graphs with near minimal distance energy, Connectivity, diameter, independence number and the distance spectral radius of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The distance matrices of some graphs related to wheel graphs
- The inertia of distance matrices of some graphs
- Distance spectral radius of digraphs with given connectivity
- Distance spectral radius of trees with given matching number
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Recent results in the theory of graph spectra
- On distance matrices and Laplacians
- The inertia and energy of distance matrices of complete \(k\)-partite graphs
- Graph Energy
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The distance spectrum of a tree
- Distance spectra and distance energies of iterated line graphs of regular graphs
- On the Addressing Problem for Loop Switching
- On the nullity of line graphs of trees