Toughness and distance spectral radius in graphs
RAIRO - Operations Research · 2026-07 · 60 (4) · 2311-2321
DOI: 10.1051/ro/2026079 ↗Kurz gefasst
Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 31.07.2026. Verfasst von Pei-Shan Li und 2 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Let G be a connected graph with vertex set V ( G ). A variation τ ( G ) of toughness of G , proposed by Enomoto in 1988, is defined as τ ( G ) = min S ⊂ V ( G ){| S |/ c ( G − S ) − 1 : c ( G − S ) > 1}, where c ( G − S ) is the number of components of G − S for a subset S of V ( G ). For a positive real number τ , G is called τ - tough if τ ( G )≥ τ Chen et al . [Discrete Math. 347 (2024) 114191] gave sufficient spectral radius conditions for a graph G to be τ -tough, where the spectral radius is the maximum eigenvalue of the adjacent matrix of G and τ or 1/ τ is a positive integer. Analogously, in this paper, we investigate the case of the distance spectral radius of G and present three tight distance spectral radius conditions, respectively, and analyze the extreme cases, which are similar to Chen et al .’s results.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Li, P., Cheng, H., & Xu, S. (2026). Toughness and distance spectral radius in graphs. RAIRO - Operations Research, 60(4), 2311-2321. https://doi.org/10.1051/ro/2026079
Vancouver
Li P, Cheng H, Xu S. Toughness and distance spectral radius in graphs. RAIRO - Operations Research. 2026;60(4):2311-2321. doi:10.1051/ro/2026079
BibTeX
@article{Li2026,
author = {Li, Pei-Shan and Cheng, Hongzhang and Xu, Shou-Jun},
title = {Toughness and distance spectral radius in graphs},
journal = {RAIRO - Operations Research},
year = {2026},
volume = {60},
number = {4},
pages = {2311--2321},
doi = {10.1051/ro/2026079}
}
EUVIMED