The distance Laplacian spectral radius of clique trees

DOI10.1155/2020/8855987MaRDI QIDQ2657421zbMATH OpenOpenAlexFDO

Authors Jiajia Zhou, Xiaoling Zhang

Publication date 12 March 2021

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/8855987

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

Summary: The distance Laplacian matrix of a connected graph \(G\) is defined as \(\mathcal{L}\left( G\right)=\mathrm{Tr}\left( G\right)-D\left( G\right)\), where \(D\left( G\right)\) is the distance matrix of \(G\) and \(\mathrm{Tr}\left( G\right)\) is the diagonal matrix of vertex transmissions of \(G\). The largest eigenvalue of \(\mathcal{L}\left( G\right)\) is called the distance Laplacian spectral radius of \(G\). In this paper, we determine the graphs with maximum and minimum distance Laplacian spectral radius among all clique trees with \(n\) vertices and \(k\) cliques. Moreover, we obtain \(n\) vertices and \(k\) cliques.

Recommendations

• Extremal results on distance Laplacian spectral radius of graphs
• On the distance Laplacian spectral radius of bicyclic graphs
• The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• On the distance signless Laplacian spectral radius of graphs

Cites work

• Distance Estrada index of random graphs
• scientific article; zbMATH DE number 6304422 (Why is no real title available?)
• On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
• On the distance and distance signless Laplacian spectral radii of bicyclic graphs
• On the distance Laplacian spectral radius of bipartite graphs
• On the distance Laplacian spectral radius of graphs
• Some properties of the distance Laplacian eigenvalues of a graph.
• Spectra of graphs
• The bicyclic graph with the minimum distance Laplacian spectral radius
• The changes in distance Laplacian spectral radius of graphs resulting from graft transformations
• The distance spectrum of complements of trees
• The generalized distance matrix
• Two Laplacians for the distance matrix of a graph

Cited in

(6)

• On the distance Laplacian spectral radius of bicyclic graphs
• Distance Laplacian spectral radius of the complements of trees and unicyclic graphs
• Eccentricity spectral radius of t-clique trees with given diameter
• Distance Laplacian spectra of graphs: a survey
• Inertia and spectral symmetry for the eccentricity matrices of clique trees
• On the intercluster distance of a tree metric

This page was built for publication: The distance Laplacian spectral radius of clique trees

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