Files

Download

Download Full Text (492 KB)

Description

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.

Publication Date

4-9-2016

Project Designation

Honors Thesis

Primary Advisor

Atif A Abueida

Primary Advisor's Department

Mathematics

Keywords

Stander Symposium poster

Disciplines

Arts and Humanities | Business | Education | Engineering | Life Sciences | Medicine and Health Sciences | Physical Sciences and Mathematics | Social and Behavioral Sciences

Star Decompositions of the Complete Split Graph

Share

COinS