Sharp lower bounds on the sum-connectivity index of quasi-tree graphs
From MaRDI portal
Publication:5083858
DOI10.1142/S1793830921501366zbMath1489.05077OpenAlexW3171344753MaRDI QIDQ5083858
Publication date: 21 June 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501366
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Unnamed Item
- Sum-connectivity index of molecular trees
- On sum-connectivity index of bicyclic graphs
- Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
- On a novel connectivity index
- New bounds for degree sequence of graphs
- Atom-bond connectivity index of quasi-tree graphs
- On the sum-connectivity index
- Relationships between Randic index and other topological indices
- Two-tree graphs with minimum sum-connectivity index
This page was built for publication: Sharp lower bounds on the sum-connectivity index of quasi-tree graphs