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

DOI10.5614/ejgta.2023.11.1.10zbMath1514.05043OpenAlexW4362733206MaRDI QIDQ6164656

Tomáš Vetrík

Publication date: 4 July 2023

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

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

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

Related Items (1)

Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the extremal graphs with respect to bond incident degree indices
• Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
• On general sum-connectivity index
• Extremal Graphs for Topological Index Defined by a Degree-Based Edge-Weight Function
• Graphs with Minimum Vertex-Degree Function-Index for Convex Functions
• On Bond Incident Degree Indices of Connected Graphs with Fixed Order and Number of Pendent Vertices
• Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions

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