Trees, unicyclic graphs and their geometric Sombor index: an extremal approach
From MaRDI portal
Publication:6563152
DOI10.1007/S40314-024-02793-5MaRDI QIDQ6563152FDOQ6563152
Authors: N. Dehgardi, Mahdieh Azari
Publication date: 27 June 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
Graph polynomials (05C31) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07)
Cites Work
- On a novel connectivity index
- Title not available (Why is that?)
- On graphs with integer Sombor index
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- On the structure of graphs with integer Sombor indices
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Vertex-weighted Wiener polynomials for composite graphs
- Sharp bounds on the inverse sum indeg index
- Lanzhou index
- Sombor index of chemical graphs
- Geometric approach to degree-based topological indices: Sombor indices
- Extremal values of the Sombor index in unicyclic and bicyclic graphs
- On Sombor index of graphs
- Entire Zagreb indices of graphs
- On the Sombor index of graphs
- Proof of an open problem on the Sombor index
- Lanzhou index of trees with fixed maximum degree
- Sombor Index of Polymers
- On the extremal Sombor index of trees with a given diameter
- On Sombor index of trees with fixed domination number
- Title not available (Why is that?)
- Lower bounds on the entire Zagreb indices of trees
- Irregularity in graphs
- The expected values and variances for Sombor indices in a general random chain
- Extremal problems on sombor indices of unicyclic graphs with a given diameter
- On relations between Sombor and other degree-based indices
- On Sombor index of trees
- Sombor index and degree-related properties of simplicial networks
- The minimum Sombor index of trees with given number of pendant vertices
- Comparison between Merrifield-Simmons index and some vertex-degree-based topological indices
- On integral Sombor indices
- Proofs to some open problems on the maximum Sombor index of graphs
- Lower bound on the KG-Sombor index
This page was built for publication: Trees, unicyclic graphs and their geometric Sombor index: an extremal approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563152)