Back to search

Georgia Southern University

Sparse Trees with a Given Degree Sequence

Abstract

dc:description.abstract

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 the summation of all sizes of subtrees which contain any k��subset of vertex set V (T). In sparse trees with a given degree sequence, by using a computer, we give some computational results with regarding to Steiner Wiener index, which may shed light on the extremal tree with maximum Steiner Wiener index.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Mathematics (M.S.)
Level thesis:degree_level
Thesis (open access)
Discipline thesis:degree_discipline
Department of Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Shen, Ao
Contributors dc:contributor
  • Daniel Grey
  • Jie Zhang

Subjects

dc:subject × 6

Rights

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.georgiasouthern.edu/etd/1814

Chain of custody

source
Harvested from
Georgia Southern University
Base URL
digitalcommons.georgiasouthern.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Shen, Ao. Sparse Trees with a Given Degree Sequence. Thesis (open access) thesis, https://digitalcommons.georgiasouthern.edu/etd/1814