Let G = (V . E) be a simple graph with vertex set.. and edge set... The Sombor index of the graph G is a degree-based topological index, defined as SO(G) = Sigma(uvE) root d(u)(2)i + d(v)(2), in which d(x) is the degree of the vertex x is an element of V for x = u.v.In this paper, we characterize the extremal trees with given degree sequence that minimize and maximize the Sombor index.
机构:
China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
Zhou, Ting
Lin, Zhen
论文数: 0引用数: 0
h-index: 0
机构:
Qinghai Normal Univ, Sch Math & Stat, Xining 810001, Qinghai, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
Lin, Zhen
Miao, Lianying
论文数: 0引用数: 0
h-index: 0
机构:
China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R ChinaChina Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
机构:
South China Agr Univ, Dept Math, Guangzhou 510642, Peoples R China
South China Agr Univ, Res Ctr Green Dev Agr, Guangzhou 510642, Peoples R ChinaSouth China Agr Univ, Dept Math, Guangzhou 510642, Peoples R China
Wei, Peichao
Liu, Muhuo
论文数: 0引用数: 0
h-index: 0
机构:
South China Agr Univ, Dept Math, Guangzhou 510642, Peoples R China
South China Agr Univ, Res Ctr Green Dev Agr, Guangzhou 510642, Peoples R ChinaSouth China Agr Univ, Dept Math, Guangzhou 510642, Peoples R China