English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{v_{i}}$ (or $d_{i}$ forshort) 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}$ areadjacent, and 0 otherwise. The $p$-Sombor spectral radius of $G$, denoted by$\displaystyle \rho(\textbf{S}_{\textbf{p}}(G))$, is the largest eigenvalue ofthe $p$-Sombor matrix $\textbf{S}_{\textbf{p}}(G)$. In this paper, we considerthe extremal trees, unicyclic and bicyclic graphs with respect to the$p$-Sombor spectral radii. We characterize completely the extremal graphs withthe first three maximum Sombor spectral radii, which answers partially aproblem posed by Liu et al. in [MATCH Commun. Math. Comput. Chem. 87 (2022)59-87].

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