2011•FilomatOpen access

On the sum-connectivity index

Shilin Wang, Bo Zhou, Nenad Trinajstić

Open full text 47 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 47 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
On the sum-connectivity index — Research Paper | ScholarLens