Extremal problems on sombor indices of unicyclic graphs with a given diameter
From MaRDI portal
Publication:2140769
Abstract: Sombor index is a novel topological index, which was introduced by Gutman and defined for a graph as , where denotes the degree of vertex in graph . Extremal problems on the Sombor index for trees with a given diameter has been considered by Chen et al. [H. Chen, W. Li, J. Wang, Extremal values on the Sombor index of trees, MATCH Commun. Math. Comput. Chem. 87 (2022) 23--49] and Li et al. [S. Li, Z. Wang, M. Zhang, On the extremal Sombor index of trees with a given diameter, Appl. Math. Comput. 416 (2022) 126731]. As an extension of results introduces above, we determine the maximum Sombor indices for unicyclic graphs with a fixed order and given diameter.
Cites work
- Extremal values of the Sombor index in unicyclic and bicyclic graphs
- Extremal values on the Sombor index of trees
- Fictitious domain finite element method for Stokes/elliptic interface problems with jump coefficients
- General Randić index of unicyclic graphs with given diameter
- General sum-connectivity index of unicyclic graphs with given diameter
- Geometric approach to degree-based topological indices: Sombor indices
- scientific article; zbMATH DE number 6383807 (Why is no real title available?)
- scientific article; zbMATH DE number 7434614 (Why is no real title available?)
- Maximal augmented Zagreb index of trees with given diameter
- On Sombor index of graphs
- On the extremal Sombor index of trees with a given diameter
- On the Kirchhoff index of bipartite graphs with given diameters
- On the structure of graphs with integer Sombor indices
- Ordering chemical graphs by Sombor indices and its applications
- Sombor index of chemical graphs
- Sombor Index of Polymers
- Spectral properties of p-Sombor matrices and beyond
- The expected values and variances for Sombor indices in a general random chain
- The minimum harmonic index for unicyclic graphs with given diameter
- Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
Cited in
(17)- The minimum Sombor index for unicyclic graphs with fixed diameter
- Multiplicative Sombor index of graphs
- The Sombor Index of Trees and Unicyclic Graphs with Given Maximum Degree
- scientific article; zbMATH DE number 6302970 (Why is no real title available?)
- The minimum Sombor index of trees with given number of pendant vertices
- An alternative proof of the Sombor index minimizing property of greedy trees
- Trees, unicyclic graphs and their geometric Sombor index: an extremal approach
- Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs
- Sharp upper bound on the Sombor index of bipartite graphs with a given diameter
- Modified Sombor index of unicyclic graphs with a given diameter
- On the augmented Sombor index of graphs
- Resolving open problems on the Euler Sombor index
- Maximum Euler Sombor index of unicyclic graphs with given diameter
- Extremal Euler Sombor index of unicyclic graphs with fixed diameter
- Exponential forgotten index and its application
- Open problems on Euler (elliptic) Sombor index of graphs
- Resolving an open problem on the modified sombor index for bicyclic graphs
This page was built for publication: Extremal problems on sombor indices of unicyclic graphs with a given diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140769)