Back to search

Georgia Southern University

Inverse Problems Related to the Wiener and Steiner-Wiener Indices

Abstract

dc:description.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?

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
  • Gentry, Matthew
Contributors dc:contributor
  • Jimmy Dillies
  • Daniel Gray

Subjects

dc:subject × 5

Rights

Identifiers

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

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

Gentry, Matthew. Inverse Problems Related to the Wiener and Steiner-Wiener Indices. Thesis (open access) thesis, https://digitalcommons.georgiasouthern.edu/etd/2001