Extreme sombor spectral radius of bicyclic graphs [Articol]

Abstract

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 xy2E(G) p d2 G(x) + d2 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.