Back to search

West Virginia University

Topics in Graph Compositions

Abstract

dc:description.abstract

For any discrete undirected graph G with vertex set V(G) and edge set E(G) (respectively), a graph composition of G is defined to be a partition of V(G) where every element of the partition yields a connected, induced subgraph of G. This dissertation is comprised of 5 chapters. The first is a general introduction to the concept of graph compositions and a survey of previously researched work; the second focuses on the composition number of deletions of specific graphs from complete graphs; the third focuses on establishing bounds for the composition number of general graphs and the Bell number coefficients of general graphs; the fourth focuses on the connection between graph compositions and Aitken's array, a well researched array; finally, the fifth focuses on the number of compositions of graphs where the number of components is restricted.

Degree

thesis:*
Name thesis:degree_name
PhD
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tichenor, Todd
Contributors dc:contributor
  • Michael Mays
  • Marjorie Darrah
  • Harvey Diamond
  • John L Goldwasser
  • Michael E Mays
  • James D Mooney

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
West Virginia University
Base URL
researchrepository.wvu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Tichenor, Todd. Topics in Graph Compositions. Dissertation thesis, https://doi.org/10.33915/etd.6811