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

2021/03/08 by Ting Zhou, Zhen Lin, Zhou, Ting +3
Chemistry · Computer Science · Mathematics · #05C09 #05C50 #05C90 #Combinatorics (math.CO) #Computational Drug Discovery Methods #FOS: Mathematics #Graph theory and applications #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.2103.04645

openalex publication_date 2021/03/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 G is defined as SO(G) =∑_{uv∈ E(G)}√(d²_G(u)+d²_G(v)), where d_G(v) is the degree of the vertex v in G. Let \mathscrT_n,m and \mathscrU_n,m be the set of trees and unicyclic graphs on n vertices with fixed matching number m, respectively. In this paper, the tree and the unicyclic graph with the maximum Sombor index are determined among \mathscrT_n,m and \mathscrU_n,m, respectively.

Citations

• Sombor index of chemical graphs

Related

• The Sombor index of trees and unicyclic graphs with given maximum degree
• Extremal problems on Sombor indices of unicyclic graphs with a given diameter
• On Sombor Index of Unicyclic graphs with a fixed number of pendant vertices
• Resolving Open Problems on the Euler Sombor Index
• Molecular trees with extremal values of the second Sombor index