The Sombor index of trees and unicyclic graphs with given maximum degree
Combinatorics
2021-03-16 v1
Abstract
Let be the degree of the vertex in a graph . The Sombor index of is defined as , which is a new degree-based topological index introduced by Gutman. Let and be the set of trees and unicyclic graphs with vertices and maximum degree , respectively. In this paper, the tree and the unicyclic graph with minimum Sombor index among and are characterized.
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