Extreme Sombor spectral radius of bicyclic graphs

چکیده مقاله

Let G be a simple graph and dG(x) be the degree of the vertex x in G. The Sombor index of graph G is denoted as SO(G) = ^P _xy∈E(G₎ ^pd²_G(x) + d²_G(y). Yinzhen Mei et al determine the upper and lower bounds of the Sombor index of unicyclic graphs in [7]. In this paper we do it for bicyclic graphs. © 2025, Institute of Mathematics and Computer Science. All rights reserved.