On the maximum ABC spectral radius of connected graphs with given maximum degree
Abstract
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.
Fields of Study & Subjects
Graph theory and applications
Tensor decomposition and applications
Synthesis and Properties of Aromatic Compounds
Publication details
- Journal / source
- Applicable Analysis and Discrete Mathematics
- Publisher
- National Library of Serbia
- Issue
- 00
- Pages
- 12–12
- Publication date
- 1 January 2026
- Language
- EN