The spectral radius and the distance spectral radius of complements of block graphs

Xu Chen, Dongjun Fan, Rongxiao Shao,Guoping Wang

arxiv(2024)

Cited 0|Views3
No score
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.
More
Translated text
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined