Two-tree graphs with minimum sum-connectivity index

DOI10.1142/S1793830921500531MaRDI QIDQ5025123zbMATH OpenFDO

Authors Akbar Jahanbani

Publication date 1 February 2022

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

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

zbMATH Keywords

sum-connectivity indextwo-trees graphs

Mathematics Subject Classification ID

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

Recommendations

• Two-tree graphs with maximum general sum-connectivity index
• 2-connected graphs with minimum general sum-connectivity index
• The minimum general sum-connectivity index of trees with given matching number
• Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
• Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number
• On the sum-connectivity index of trees
• The minimum size of a graph with given tree connectivity
• Two-graphs and trees
• Trees and unicyclic graphs extremal with respect to sum connectivity index
• scientific article; zbMATH DE number 6113922

Cites work

• Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
• On a novel connectivity index
• On the sum-connectivity index
• Sum-connectivity index of molecular trees
• The harmonic index of two-trees and quasi-tree graphs

Cited in

(4)

• General sum-connectivity index of a graph and its line graph
• Two-tree graphs with maximum general sum-connectivity index
• On the sum-connectivity index of trees
• Sharp lower bounds on the sum-connectivity index of quasi-tree graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025123)