2-connected graphs with minimum general sum-connectivity index

DOI10.1016/j.dam.2014.06.023zbMath1297.05135OpenAlexW2113091544MaRDI QIDQ741542

Ioan Tomescu

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.06.023

zbMATH Keywords

Jensen's inequalityminimum degreeconcave functiongeneral sum-connectivity indexharmonic index2-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07)

Related Items (6)

The sharp bounds on general sum-connectivity index of four operations on graphs ⋮ General sum-connectivity index of a graph and its line graph ⋮ On the general sum-connectivity index of trees with given number of pendent vertices ⋮ The minimum general sum-connectivity index of trees with given matching number ⋮ On the general sum-connectivity index of connected graphs with given order and girth ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unicyclic graphs of given girth \(k\geq 4\) having smallest general sum-connectivity index
• Minimum general sum-connectivity index of unicyclic graphs
• On the general sum-connectivity index of trees
• On a novel connectivity index
• On general sum-connectivity index

This page was built for publication: 2-connected graphs with minimum general sum-connectivity index