Work

Maximum General Sum-Connectivity Index of Trees and Unicyclic Graphs with Given Order and Number of Pendant Vertices

Year: 2025

Type: article

Abstract: For a∈R, the general sum-connectivity index of a graph G is defined as χa(G)=∑uv∈E(G)[dG(u)+dG(v)]a, where E(G) is the set of edges of G and dG(u) and dG(v) are the degrees of vertices u and v, respectively. For trees and unicyclic graphs with given order and number of pendant vertices, we present upper bounds on the general sum-connectivity index χa, where 0

Source: Mathematics

DOI: 10.3390/math13193061

Authors: Elize Swartz, Tomáš Vetrík

Institution: University of the Free State

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $3,137

Funder: National Research Foundation