Two-tree graphs with maximum general sum-connectivity index

DOI10.1142/S1793830921500257zbMath1475.05039OpenAlexW3093647205MaRDI QIDQ5013472

Hajar Shooshtari, Rana Khoeilar

Publication date: 30 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500257

zbMATH Keywords

general sum-connectivity indextwo-tree graphs

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (2)

General sum-connectivity index of unicyclic graphs with given diameter and girth ⋮ General sum-connectivity index of a graph and its line graph

Cites Work

• 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
• Some new bounds on the general sum--connectivity index
• The harmonic index of two-trees and quasi-tree graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-tree graphs with maximum general sum-connectivity index