An alternative proof of the Sombor index minimizing property of greedy trees
DOI10.2298/PIM2327057DOpenAlexW4379799606MaRDI QIDQ6096885FDOQ6096885
Authors: Ivan Damnjanović, Dragan Stevanović
Publication date: 15 September 2023
Published in: Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/pim2327057d
Recommendations
Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Greedy trees, caterpillars, and Wiener-type graph invariants
- Eccentricity sums in trees
- Greedy trees, subtrees and antichains
- Functions on adjacent vertex degrees of trees with given degree sequence
- Extremal trees with fixed degree sequence
- Spectral moments of trees with given degree sequence
- Title not available (Why is that?)
- On the distance spectral radius of trees with given degree sequence
- 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
- The minimum Sombor index for unicyclic graphs with fixed diameter
- On Sombor index of graphs
- Ordering chemical graphs by Sombor indices and its applications
- Trees with maximum vertex-degree-based topological indices
- A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence
- General properties on Sombor indices
- Sombor Index of Polymers
- On the extremal Sombor index of trees with a given diameter
- Extremal values on the Sombor index of trees
- On Sombor index of trees with fixed domination number
- 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
- Sombor index: review of extremal results and bounds
- Sombor index of trees with at most three branch vertices
- On Sombor index of trees
- Sombor index and degree-related properties of simplicial networks
- On the graphs with minimum Sombor index
- Vertex-degree-based topological indices of oriented trees
- Note on Sombor index of connected graphs with given degree sequence
This page was built for publication: An alternative proof of the Sombor index minimizing property of greedy trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6096885)