Matching number, connectivity and eigenvalues of distance signless Laplacians
From MaRDI portal
Publication:4965575
DOI10.1080/03081087.2019.1588218zbMath1459.05270OpenAlexW2921524053MaRDI QIDQ4965575
Publication date: 6 March 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1588218
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
- Spectra of graphs
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number
- Proof of a conjecture on the distance Laplacian spectral radius of graphs
- On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
- Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
- The complements of path and cycle are determined by their distance (signless) Laplacian spectra
- Distance and distance signless Laplacian spread of connected graphs
- 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
- On the distance signless Laplacian spectral radius of graphs and digraphs
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
- Some properties of the distance Laplacian eigenvalues of a graph
- The Factorization of Linear Graphs
This page was built for publication: Matching number, connectivity and eigenvalues of distance signless Laplacians
