The Sombor index of trees and unicyclic graphs with given matching number

preprint2021arXivOpen access

Abstract

In 2021, the Sombor index was introduced by Gutman, which is a new degree-based topological molecular descriptors. The Sombor index of a graph GG is defined as SO(G)=∑uv∈E(G)dG2(u)+dG2(v)SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}, where dG(v)d_G(v) is the degree of the vertex vv in GG. Let Tn,m\mathscr{T}_{n,m} and Un,m\mathscr{U}_{n,m} be the set of trees and unicyclic graphs on nn vertices with fixed matching number mm, respectively. In this paper, the tree and the unicyclic graph with the maximum Sombor index are determined among Tn,m\mathscr{T}_{n,m} and Un,m\mathscr{U}_{n,m}, respectively.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.