Note on Sombor index of connected graphs with given degree sequence

DOI10.1016/J.DAM.2023.01.002MaRDI QIDQ6416247arXivFDO

Authors Peichao Wei, Muhuo Liu

Publication date 5 November 2022

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DAM.2023.01.002

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

arXiv classification

math.CO

Abstract: For a simple connected graph $G=(V,E)$, let $d(u)$ be the degree of the vertex $u$ of $G$. The general Sombor index of $G$ is defined as ${\displaystyle }$SO_{alpha}(G)=sum_{uvin E} left[d(u)^2+d(v)^2 ight]^alpha${\displaystyle }$ where $SO(G)=S{O}_{0.5}(G)$ is the recently invented Sombor index. In this paper, we show that in the class of connected graphs with a fixed degree sequence (for which the minimum degree being equal to one), there exists a special extremal $BFS$-graph with minimum general Sombor index for $0<alpha<1$ (resp. maximum general Sombor index for either $alpha>1$ or $alpha<0$). Moreover, for any given tree, unicyclic, and bicyclic degree sequences with minimum degree 1, there exists a unique extremal $BFS$-graph with minimum general Sombor index for $0<alpha<1$ and maximum general Sombor index for either $alpha>1$ or $alpha<0$.

This page was built for publication: Note on Sombor index of connected graphs with given degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6416247)