Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of fractional matching number
From MaRDI portal
Publication:2687687
DOI10.1007/s40305-021-00358-5OpenAlexW3198756429MaRDI QIDQ2687687
Publication date: 7 March 2023
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-021-00358-5
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- Two Laplacians for the distance matrix of a graph
- The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
- Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of matching number
- On the distance Laplacian spectral radius of bipartite graphs
- On the distance Laplacian spectral radius of graphs