Browsing by Author "Lindner, Charles C."

Now showing items 1-9 of 9

4-cycles systems of line graphs of complete multipartite graphs

Sehgal, Nidhi (2008-08-15)

Here we investigate the necessary and sufficient conditions for the existence of 4 - cycle systems of the line graphs of complete multipartite graphs.

Bounded Complete Embedding Graphs

Aust, Jennifer Katherine (2015-07-21)

In the study of graph embeddings, there is particular interest in small embeddings and in bounds on the minimum number of vertices that must be added in order to achieve an embedding of a particular design. We introduce ...

Disjoint Intersection Problem For Steiner Triple Systems

Srinivasan, Sangeetha (2007-12-15)

Let (S, T_1) and (S, T_2) be two Steiner Triple systems on the set S of symbols with the set of triples T_1 and T_2 respectively. They are said to intersect in m blocks if |T_1 intersection T_2| = m. Further, if the blocks ...

Hamilton Decompositions of Graphs with Primitive Complements

Ozkan, Sibel (2007-05-15)

A graph G is a pair (V, E) where V is the set of vertices(or nodes) and E is the set of edges connecting the vertices. A graph is called k-regular, if all of its vertices are incident with k edges. A k-factor of a graph G ...

The Intersection Problem for Latin Squares with Holes of Size 2 and 3

Baker, Charla (2009-04-28)

In this dissertation we give complete solutions for the intersection problem of latin squares with holes of size 2 and 3. For a pair of 2n x 2n latin squares with holes of size 2 to have k entries in common outside of ...

k-star Decompositions of Lambda-Fold Complete Multipartite Graphs

Anzur, Matthew (2007-08-15)

We examine the problem of k-star decompositions on lambda-fold complete multipartite graphs. After a brief examination of the computational complexity issues involved, we present complete proofs for necessary and sufficient ...

On the Spectrum of Minimal Covers By Triples

Castellana, Vincent (2006-08-15)

A Minimal Cover by Triples is an ordered pair (V,T) where V is a finite set and T is a collection of three element subsets of V with two properties. First, that every pair of elements of V appear together in at least ...

Path and Cycle Decompositions

Dinavahi, Venkatasai (2008-08-15)

A $G$-design is a partition of edge set of K_v in which each element induces a copy of G. The existence of G-designs with the additional property that they contain no proper subsystems has been previously settled when G ...

The Triangle Intersection Problem For Hexagon Triple Systems

Pettis, Carl (2006-08-15)

The Triangle Intersection Problem for Hexagon Triple Systems Carl S. Pettis, Auburn University A hexagon triple is the graph and a hexagon triple system is an edge disjoint decomposition of ...