On Sombor index of graphs with a given number of cut-vertices
From MaRDI portal
Publication:5050778
Abstract: Introduced by Gutman in 2021, the Sombor index is a novel graph-theoretic topological descriptor possessing potential applications in the modeling of thermodynamic properties of compounds. Let G^k_n be the set of all n-vertex connected graphs with k cut-vertices. In this paper, we present minimum Sombor indices of graphs in G^k_n. The corresponding extremal graphs have been characterized as well.
Recommendations
Cites work
- Extremal values of the Sombor index in unicyclic and bicyclic graphs
- Extremal values on the Sombor index of trees
- Geometric approach to degree-based topological indices: Sombor indices
- Graphs with given number of cut vertices and extremal Merrifield-Simmons index
- scientific article; zbMATH DE number 7434614 (Why is no real title available?)
- On relations between Sombor and other degree-based indices
- On Sombor index of graphs
- On Sombor index of trees
- On Sombor index of trees with fixed domination number
- On some mathematical properties of Sombor indices
- On the extremal Sombor index of trees with a given diameter
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- Ordering chemical graphs by Sombor indices and its applications
- Relations between Sombor index and some degree-based topological indices
- Sombor index and degree-related properties of simplicial networks
- Sombor index of chemical graphs
- Sombor Index of Polymers
- The minimal Kirchhoff index of graphs with a given number of cut vertices
Cited in
(4)
This page was built for publication: On Sombor index of graphs with a given number of cut-vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050778)