Term of Award
Fall 2019
Degree Name
Master of Science in Mathematics (M.S.)
Document Type and Release Option
Thesis (open access)
Copyright Statement / License for Reuse
This work is licensed under a Creative Commons Attribution 4.0 License.
Department
Department of Mathematical Sciences
Committee Chair
Hua Wang
Committee Member 1
Jimmy Dillies
Committee Member 2
Daniel Gray
Abstract
In a graph, the generalized distance between multiple vertices is the minimum number of edges in a connected subgraph that contains these vertices. When we consider such distances between all subsets of $k$ vertices and take the sum, it is called the Steiner $k$-Wiener index and has important applications in Chemical Graph Theory. In this thesis we consider the inverse problems related to the Steiner Wiener index, i.e. for what positive integers is there a graph with Steiner Wiener index of that value?
Recommended Citation
Gentry, Matthew, "Inverse Problems Related to the Wiener and Steiner-Wiener Indices" (2019). Electronic Theses and Dissertations. 2001.
https://digitalcommons.georgiasouthern.edu/etd/2001
Research Data and Supplementary Material
No
