Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Extremal trees for Maximum Sombor index with given degree sequence (2211.06396v1)

Published 10 Nov 2022 in math.CO

Abstract: Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. The Sombor index of the graph $G$ is a degree-based topological index, defined as $$SO(G)=\sum_{uv \in E}\sqrt{d(u)2+d(v)2},$$ in which $d(x)$ is the degree of the vertex $x \in V$ for $x=u, v$. In this paper, we characterize the extremal trees with a given degree sequence that maximizes the Sombor index.

Summary

We haven't generated a summary for this paper yet.