On the distance and distance Laplacian eigenvalues of graphs

DOI10.1016/J.LAA.2015.11.014zbMath1330.05104OpenAlexW2192813113MaRDI QIDQ5962507

Yingying Chen, Jin-Long Shu, Huiqiu Lin, Baoyindureng Wu

Publication date: 12 February 2016

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.11.014

zbMATH Keywords

distance matrixdistance Laplacian matrixdistance Laplacian spectral radius

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (16)

Distance (signless) Laplacian spectral radius of uniform hypergraphs ⋮ Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ Spectral distances in some sets of graphs ⋮ Proof of a conjecture on the distance Laplacian spectral radius of graphs ⋮ On the multiplicities of distance Laplacian eigenvalues ⋮ Extremal cacti of given matching number with respect to the distance spectral radius ⋮ Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs ⋮ On the first two largest distance Laplacian eigenvalues of unicyclic graphs ⋮ On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity ⋮ On distance Laplacian spectral radius and chromatic number of graphs ⋮ Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph ⋮ Distance matrices on the \textit{H-join} of graphs: a general result and applications ⋮ Distance Laplacian spectra of graphs: a survey ⋮ On distance Laplacian and distance signless Laplacian eigenvalues of graphs ⋮ Extremal results on distance Laplacian spectral radius of graphs

Cites Work

• Two Laplacians for the distance matrix of a graph
• On the distance spectral radius of some graphs
• On graphs with three distinct Laplacian eigenvalues
• On the distance matrix of a tree
• Interlacing eigenvalues and graphs
• Distance spectra of graphs: a survey
• On graphs with at least three distance eigenvalues less than \(-1\)
• Complete multipartite graphs are determined by their distance spectra
• On the distance spectrum of graphs
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• Some properties of the distance Laplacian eigenvalues of a graph
• On the Addressing Problem for Loop Switching

This page was built for publication: On the distance and distance Laplacian eigenvalues of graphs