On the general sum-connectivity index of connected graphs with given order and girth
DOI10.5614/ejgta.2016.4.1.1zbMath1467.05136OpenAlexW2340538715MaRDI QIDQ5006570
Publication date: 16 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2016.4.1.1
convex functiongirthJensen inequalitysubadditive functionpendant vertexgeneral sum-connectivity indexzeroth-order general randic index
Extremal problems in graph theory (05C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40) Signed and weighted graphs (05C22) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the general sum-connectivity index of connected unicyclic graphs with \(k\) pendant vertices
- 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
- 2-connected graphs with minimum general sum-connectivity index
- On general sum-connectivity index
This page was built for publication: On the general sum-connectivity index of connected graphs with given order and girth