Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number

DOI10.1016/j.laa.2016.06.028zbMath1344.05090OpenAlexW2474652038MaRDI QIDQ739130

Dein Wong, Xiaobin Ma, Fenglei Tian

Publication date: 17 August 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.2016.06.028

zbMATH Keywords

spectral radiusmatching numberdistance Laplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Note on distance signless Laplacian spectral radius under given matching number, Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of fractional matching number, On maximal energy of line graphs with given parameters, Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph, Matching number, connectivity and eigenvalues of distance signless Laplacians

Cites Work

• Unnamed Item
• Two Laplacians for the distance matrix of a graph
• On the distance Laplacian spectra of graphs
• Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph
• On the distance Laplacian spectral radius of bipartite graphs
• On the distance Laplacian spectral radius of graphs
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• On the distance signless Laplacian of a graph
• On the distance signless Laplacian spectral radius of graphs
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• Some properties of the distance Laplacian eigenvalues of a graph
• The Factorization of Linear Graphs