What question did this study set out to answer?

To investigate the maximum ABC spectral radius of connected graphs with a specified maximum degree.

April 10, 2026Open Access

On the maximum ABC spectral radius of connected graphs with given maximum degree

Puntos clave

To investigate the maximum ABC spectral radius of connected graphs with a specified maximum degree.
Develop a mathematical inequality for the ABC spectral radius of connected graphs.
Analyze specific types of graphs including trees, unicyclic and bicyclic graphs.
Establish upper bounds based on the number of vertices and edges.
Demonstrated that the ABC spectral radius is bounded by a specific formula.
Reproduced upper bounds for various types of connected graphs.
Found insights applicable to both theoretical and practical graph structures.

Resumen

The ABC spectral radius of a graph G, denoted by? (G), has attracted more p and more attentions. In this paper, we prove that (G) + 2m - n + 1{-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.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Cite this study

Lin et al. (Thu,) studied this question.

www.synapsesocial.com/papers/69d893896c1944d70ce0481e — DOI: https://doi.org/10.2298/aadm231107012l

Authors

Wenshui Lin

Ningyu Chen

Jia-Bao Liu

Journals

Applicable Analysis and Discrete Mathematics

Actions

Institutions

Xiamen University

Anhui Jianzhu University

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

On the maximum ABC spectral radius of connected graphs with given maximum degree

Puntos clave

Resumen

Citation Network

Connected Papers

Discussion

Cite this study

Authors

Journals

Actions

Institutions

References and Citations

Citation Network

Connected Papers

Discussion