A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence

DOI10.46793/MATCH.90-1.197DzbMath1519.92353arXiv2211.11920OpenAlexW4321440243MaRDI QIDQ6167508

Marko Milošević, Ivan Damnjanović, Dragan Stevanović

Publication date: 10 July 2023

Published in: Match Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.11920

zbMATH Keywords

extremal valuegreedy treeSombor index

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Related Items (1)

An alternative proof of the Sombor index minimizing property of greedy trees

Cites Work

• Functions on adjacent vertex degrees of trees with given degree sequence
• Unnamed Item

This page was built for publication: A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence