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

DOI10.11650/TJM/231002OpenAlexW4387680753MaRDI QIDQ6145752FDOQ6145752

Authors:

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

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

Cites Work

• Two Laplacians for the distance matrix of a graph
• The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
• On the distance Laplacian spectra of graphs
• On the distance Laplacian spectral radius of graphs
• Some properties of the distance Laplacian eigenvalues of a graph.
• The Laplacian spectral radius of some bipartite graphs
• 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

Cited In (1)

• Distance Laplacian spectra of graphs: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145752)