Extremal trees, unicyclic and bicyclic graphs with respect to $p$-Sombor spectral radii

Abstract: For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{v_{i}}$ (or $d_{i}$ for short) the degree of vertex $v_{i}$. The $p$-Sombor matrix $\textbf{S}{\textbf{p}}(G)$ ($p\neq0$) of a graph $G$ is a square matrix, where the $(i,j)$-entry is equal to $\displaystyle (d{i}^{p}+d_{j}^{p})^{\frac{1}{p}}$ if the vertices $v_{i}$ and $v_{j}$ are adjacent, and 0 otherwise. The $p$-Sombor spectral radius of $G$, denoted by $\displaystyle \rho(\textbf{S}{\textbf{p}}(G))$, is the largest eigenvalue of the $p$-Sombor matrix $\textbf{S}{\textbf{p}}(G)$. In this paper, we consider the extremal trees, unicyclic and bicyclic graphs with respect to the $p$-Sombor spectral radii. We characterize completely the extremal graphs with the first three maximum Sombor spectral radii, which answers partially a problem posed by Liu et al. in [MATCH Commun. Math. Comput. Chem. 87 (2022) 59-87].