On the sum-connectivity index
Shilin Wang, Bo Zhou, Nenad Trinajstić
Abstract
Open-access reader
Shilin Wang, Bo Zhou, Nenad Trinajstić
Abstract
Open-access reader
The sum-connectivity index of a simple graph G is defined in mathematical chemistry as R+(G) = ? uv?E(G)(du+dv)?1/2, where E(G) is the edge set of G and du is the degree of vertex u in G. We give a best possible lower bound for the sum-connectivity index of a graph (a triangle-free graph, respectively) with n vertices and minimum degree at least two and characterize the extremal graphs, where n ? 11.
OpenAlex reports 47 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The sum-connectivity index of a simple graph G is defined in mathematical chemistry as R+(G) = ? uv?E(G)(du+dv)?1/2, where E(G) is the edge set of G and du is the degree of vertex u in G. We give a best possible lower bound for the sum-connectivity index of a graph (a triangle-free graph, respectively) with n vertices and minimum degree at least two and characterize the extremal graphs, where n ? 11.
Key concepts: Mathematics, Combinatorics, Vertex (graph theory), Bound graph, Graph, Simple graph, Connectivity, Topological index