PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 1, 20240 citationsOpen Access

On the Sombor index of trees with degree restrictions

View Full Paper
EAEric Ould Dadah AndriantianaVRValisoa R. M. Rakotonarivo

Key Points

Key points are not available for this paper at this time.

Abstract

We study the Sombor index of trees with various degree restrictions. In addition to rediscovering that among all trees with a given degree sequence, the greedy tree minimises the Sombor index and the alternating greedy tree maximises it, we also provide a full characterisation of all trees that have those maximum or minimum values. Moreover, we compare trees with different degree sequences and deduce a few corollaries.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Andriantiana et al. (2024) studied this question.

synapsesocial.com/papers/68e713d7b6db64358768cd2ahttps://doi.org/10.48550/arxiv.2404.01442
Ask AI
Helpful
Bookmark
Share
View Full Paper