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

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chen, Xu, Fan, Dongjun, Shao, Rongxiao, Wang, Guoping
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909213344661504
author Chen, Xu
Fan, Dongjun
Shao, Rongxiao
Wang, Guoping
author_facet Chen, Xu
Fan, Dongjun
Shao, Rongxiao
Wang, Guoping
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_19999
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The spectral radius and the distance spectral radius of complements of block graphs
Chen, Xu
Fan, Dongjun
Shao, Rongxiao
Wang, Guoping
Combinatorics
Spectral Theory
05C12, 05C50, 05C69
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.
title The spectral radius and the distance spectral radius of complements of block graphs
topic Combinatorics
Spectral Theory
05C12, 05C50, 05C69
url https://arxiv.org/abs/2405.19999