Proof of a conjecture concerning maximum general sum-connectivity index \(\chi_\alpha\) of graphs with given cyclomatic number when \(1 < \alpha < 2\)

DOI10.1016/j.dam.2019.07.007zbMath1420.05088OpenAlexW2963907158WikidataQ123359535 ScholiaQ123359535MaRDI QIDQ2322892

Ioan Tomescu

Publication date: 5 September 2019

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

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

zbMATH Keywords

convex functioncyclomatic numberstargeneral sum-connectivity indexgeneral zeroth-order Randić index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

A note on polyomino chains with extremum general sum-connectivity index ⋮ Sombor Index of c-Cyclic Chemical Graphs ⋮ Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs ⋮ On the maximum general sum-connectivity index of trees with a fixed order and maximum degree

Uses Software

• WolframAlpha

Cites Work

• 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 the extremal graphs with respect to bond incident degree indices
• On the extremal graphs for general sum-connectivity index \((\chi_{{}_\alpha})\) with given cyclomatic number when \(\alpha > 1\)
• On general sum-connectivity index
• Extremal topological indices for graphs of given connectivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof of a conjecture concerning maximum general sum-connectivity index \(\chi_\alpha\) of graphs with given cyclomatic number when \(1 < \alpha < 2\)