English

The Sombor index of trees and unicyclic graphs with given maximum degree

Combinatorics 2021-03-16 v1

Abstract

Let dG(v)d_G(v) be the degree of the vertex vv in a graph GG. The Sombor index of GG is defined as SO(G)=uvE(G)dG2(u)+dG2(v)SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}, which is a new degree-based topological index introduced by Gutman. Let Tn,Δ\mathscr{T}_{n,\Delta} and Un,Δ\mathscr{U}_{n,\Delta} be the set of trees and unicyclic graphs with nn vertices and maximum degree Δ\Delta, respectively. In this paper, the tree and the unicyclic graph with minimum Sombor index among Tn,Δ\mathscr{T}_{n,\Delta} and Un,Δ\mathscr{U}_{n,\Delta} are characterized.

Keywords

Cite

@article{arxiv.2103.07947,
  title  = {The Sombor index of trees and unicyclic graphs with given maximum degree},
  author = {Ting Zhou and Zhen Lin and Lianying Miao},
  journal= {arXiv preprint arXiv:2103.07947},
  year   = {2021}
}

Comments

10 pages, 2 figures. arXiv admin note: text overlap with arXiv:2103.04645