On the maximum ABC spectral radius of connected graphs with given maximum degree
Applicable Analysis and Discrete Mathematics · 2026 · (00) · 12-12
DOI: 10.2298/aadm231107012l ↗Kurz gefasst
Fachartikel in der Zeitschrift Applicable Analysis and Discrete Mathematics, 2026. Verfasst von Wenshui Lin und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The ABC spectral radius of a graph G, denoted by ?(G), has attracted more p and more attentions. In this paper, we prove that \rho(G) \le \sqrt{\Delta + \frac{2m - n + 1}{\Delta-2} }, where G is a connected graph with n vertices, m edges, and maximum degree ?. As applications, we reproduce the upper bounds of ABC spectral radius for connected graphs, trees, unicyclic graphs, and bicyclic graphs.
Zitieren
APA
Lin, W., Chen, N., & Liu, J. (2026). On the maximum ABC spectral radius of connected graphs with given maximum degree. Applicable Analysis and Discrete Mathematics, 12-12. https://doi.org/10.2298/aadm231107012l
Vancouver
Lin W, Chen N, Liu J. On the maximum ABC spectral radius of connected graphs with given maximum degree. Applicable Analysis and Discrete Mathematics. 2026:12-12. doi:10.2298/aadm231107012l
BibTeX
@article{Lin2026,
author = {Lin, Wenshui and Chen, Ningyu and Liu, Jia-Bao},
title = {On the maximum ABC spectral radius of connected graphs with given maximum degree},
journal = {Applicable Analysis and Discrete Mathematics},
year = {2026},
number = {00},
pages = {12--12},
doi = {10.2298/aadm231107012l}
}
EUVIMED