The spectral radius and the distance spectral radius of complements of block graphs
Xu Chen, Dongjun Fan, Rongxiao Shao, Guoping Wang
TL;DR
This paper characterizes the extremal spectral and distance spectral radii of complements of clique trees and block graphs, identifying graphs with maximum and minimum values within these classes.
Contribution
It provides the first comprehensive analysis of spectral properties of complements of clique trees and block graphs, identifying extremal graphs for these measures.
Findings
Identified graphs with maximum and minimum spectral radius among complements of clique trees.
Determined graphs with extremal distance spectral radius among complements of block graphs.
Provided theoretical bounds for spectral measures in these graph classes.
Abstract
In this paper, we determine the graphs whose spectral radius and distance spectral radius attain maximum and minimum among all complements of clique trees. Furthermore, we also determine the graphs whose spectral radius and distance spectral radius attain minimum and maximum among all complements of block graphs, respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Finite Group Theory Research