Honors Theses

Author(s)

Adam C. Volk

Advisor

Atif Abueida, Ph.D.

Department

Mathematics

Publication Date

4-2016

Document Type

Honors Thesis

Abstract

A graph is a discrete mathematical structure that consists of a set of vertices and a set of edges between pairs of vertices. A problem of interest in graph theory is that of graph decomposition, partitioning the set of edges into disjoint sets, producing subgraphs which are isomorphic to each other. Here we consider the problem of decomposing a class of graphs called complete split graphs into stars of a fixed size. We present conditions for the decomposition as well as an algorithm for the decomposition when it is possible.

Disciplines

Physical Sciences and Mathematics


Share

COinS