Distance Laplacian spectral radius of the complements of trees and unicyclic graphs

DOI10.11650/tjm/231002OpenAlexW4387680753MaRDI QIDQ6145752

No author found.

Publication date: 2 February 2024

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm/231002

zbMATH Keywords

treesunicyclic graphsdistance Laplacian spectral radiusthe complement of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Two Laplacians for the distance matrix of a graph
• On the distance Laplacian spectra of graphs
• The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• The distance spectrum of complements of trees
• The distance eigenvalues of the complements of unicyclic graphs
• On distance signless Laplacian spectrum of the complements of unicyclic graphs and trees
• On the distance Laplacian spectral radius of graphs
• The Laplacian spectral radius of some bipartite graphs
• Some properties of the distance Laplacian eigenvalues of a graph

This page was built for publication: Distance Laplacian spectral radius of the complements of trees and unicyclic graphs