A note on extremal trees with degree conditions

Yongxin Lan, Tao Li, Hua Wang and Chengyi Xia

Applied Mathematics and Computation, 2019, vol. 341, issue C, 70-79

Abstract: A fundamental question in the study of graph invariants asks for the extremal structures under certain constraints that maximize or minimize a graph invariant. In this note, we summarize some recent work on the extremal trees of distance-based and degree-based graph invariants under various degree conditions. We note that many of such extremal structures turned out to be identical for different but similar invariants. Such common extremal structures are investigated through the greedy trees and majorization between degree sequences. We show that many of the known extremal results can be obtained through this line of arguments. We also introduce some new extremal results as immediate consequences.

Keywords: Trees; Degree conditions; Extremal; Distance; Degree sequence; Majorization (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318307409
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:341:y:2019:i:c:p:70-79

DOI: 10.1016/j.amc.2018.08.026

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().