General sum-connectivity index of unicyclic graphs with given diameter and girth
From MaRDI portal
Publication:5083862
DOI10.1142/S1793830921501408zbMath1489.05024OpenAlexW3167022404MaRDI QIDQ5083862
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/s1793830921501408
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items (1)
Cites Work
- Unnamed Item
- 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
- General eccentric connectivity index of trees and unicyclic graphs
- Sharp bounds for the general sum-connectivity indices of transformation graphs
- Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number
- On the general sum-connectivity index of trees with given number of pendent vertices
- On general sum-connectivity index
- General sum-connectivity index of unicyclic graphs with given diameter
- Two-tree graphs with maximum general sum-connectivity index
- On the maximum general sum-connectivity index of trees with a fixed order and maximum degree
- Maximizing general first Zagreb and sum-connectivity indices for unicyclic graphs with given independence number
This page was built for publication: General sum-connectivity index of unicyclic graphs with given diameter and girth