General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index

DOI10.5614/EJGTA.2023.11.1.10MaRDI QIDQ6164656zbMATH OpenOpenAlexFDO

Authors Tomáš Vetrík

Publication date 4 July 2023

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2023.11.1.10

zbMATH Keywords

topological indexextremal graphgeneral sum-connectivity index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Recommendations

• Extremal results concerning the general sum-connectivity index in some classes of connected graphs
• Two-tree graphs with maximum general sum-connectivity index
• Trees with a given order and matching number that have maximum general sum-connectivity index.
• General sum-connectivity index of trees and unicyclic graphs with fixed maximum degree
• On general sum-connectivity index of trees of fixed maximum degree and order

Cites work

• Extremal graphs for topological index defined by a degree-based edge-weight function
• Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
• Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions
• Graphs with minimum vertex-degree function-index for convex functions
• Harmonic index and its generalizations: extremal results and bounds
• On bond incident degree indices of connected graphs with fixed order and number of pendent vertices
• On general sum-connectivity index
• On the extremal graphs with respect to bond incident degree indices
• The path and the star as extremal values of vertex-degree-based topological indices among trees

Cited in

(5)

• Extremal Graphs for Vertex-Degree-Based Indices with Given Matching Number
• Extremal results and bounds for atom-bond sum-connectivity index
• Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
• Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs
• Maximum bond incident degree indices of trees with given independence number

This page was built for publication: General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index

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