Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
From MaRDI portal
Publication:1791693
DOI10.1016/J.LAA.2018.08.026zbMath1397.05106OpenAlexW2888666399WikidataQ129339451 ScholiaQ129339451MaRDI QIDQ1791693
Publication date: 11 October 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.08.026
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Characterization of extremal graphs from distance signless Laplacian eigenvalues
- The effect of graft transformations on distance signless Laplacian spectral radius
- Two Laplacians for the distance matrix of a graph
- Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
- The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
- Spectra of graphs
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number
- On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
- 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 signless Laplacian of a graph
- 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
- On the distance and distance Laplacian eigenvalues of graphs
This page was built for publication: Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
