Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Mathematics
Sparse Trees With A Given Degree Sequence, Ao Shen
Sparse Trees With A Given Degree Sequence, Ao Shen
Electronic Theses and Dissertations
In this thesis, we consider the properties of sparse trees and summarized a certain class of trees under some constraint (including with a given degree sequence, with given number of leaves, with given maximum degree, etc.) which have maximum Wiener index and the minimum number of subtrees at the same time. Wiener index is one of the most important topological indices in chemical graph theory. Steiner k�� Wiener index can be regarded as the generalization of Wiener index, when k = 2, Steiner Wiener index is the same as Wiener index. Steiner k�� Wiener index of a tree T is …
Graph Invariants Of Trees With Given Degree Sequence, Rachel Bass
Graph Invariants Of Trees With Given Degree Sequence, Rachel Bass
Electronic Theses and Dissertations
Graph invariants are functions defined on the graph structures that stay the same under taking graph isomorphisms. Many such graph invariants, including some commonly used graph indices in Chemical Graph Theory, are defined on vertex degrees and distances between vertices. We explore generalizations of such graph indices and the corresponding extremal problems in trees. We will also briefly mention the applications of our results.