Unicyclic graphs of given girth \(k\geq 4\) having smallest general sum-connectivity index
From MaRDI portal
Publication:496696
DOI10.1016/j.dam.2013.09.019zbMath1321.05141OpenAlexW1983169983MaRDI QIDQ496696
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.019
Related Items (11)
On the general sum-connectivity index of tricyclic graphs ⋮ The sharp bounds on general sum-connectivity index of four operations on graphs ⋮ General sum-connectivity index of unicyclic graphs with given diameter and girth ⋮ Bounds of degree-based molecular descriptors for generalized \(F\)-sum graphs ⋮ General sum-connectivity index of a graph and its line graph ⋮ On the general sum-connectivity index of connected unicyclic graphs with \(k\) pendant vertices ⋮ On the general sum-connectivity index of trees with given number of pendent vertices ⋮ 2-connected graphs with minimum general sum-connectivity index ⋮ The minimum general sum-connectivity index of trees with given matching number ⋮ Proof of a conjecture concerning maximum general sum-connectivity index \(\chi_\alpha\) of graphs with given cyclomatic number when \(1 < \alpha < 2\) ⋮ On the general sum-connectivity index of connected graphs with given order and girth
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The harmonic index for graphs
- Degree distance of unicyclic and bicyclic graphs
- 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
- Unicyclic and bicyclic graphs having minimum degree distance
This page was built for publication: Unicyclic graphs of given girth \(k\geq 4\) having smallest general sum-connectivity index
