Work

On the Maximum Sombor Index of Unicyclic Graphs with a Fixed Girth

Year: 2022

Type: article

Abstract: Let G be a graph having the set of edges E(G). Represent by dG(u) the degree of a vertex u of G. The Sombor (SO) index of G is defined as . The length of a shortest cycle in a graph G is known as the girth of G. A connected graph with the same order and size is usually referred to as a (connected) unicyclic graph. This paper reports the characterization of the graphs possessing the first‐two maximum values of the SO index in the class of all (connected) unicyclic graphs with a fixed girth and order.

Source: Journal of Mathematics

DOI: 10.1155/2022/8202681

Authors: B. Senthilkumar, Y. B. Venkatakrishnan, S. Balachandran, Akbar Ali, Tariq A. Alraqad, Amjad E. Hamza

Institutions: SASTRA University, University of Ha'il

Language: English

Topic: Graph theory and applications

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $2,160

Funder: University of Hail