Proves upper bounds on the ABC spectral radius in connected graphs, highlighting graph properties.
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.
No takes yet. Share an insight, caveat, or question.
Lin et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: