Adam Christopher Volk
Download Full Text (490 KB)
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.
Atif A Abueida
Primary Advisor's Department
Stander Symposium poster
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" (2016). Stander Symposium Posters. 744.
Arts and Humanities Commons, Business Commons, Education Commons, Engineering Commons, Life Sciences Commons, Medicine and Health Sciences Commons, Physical Sciences and Mathematics Commons, Social and Behavioral Sciences Commons