This Is AuburnElectronic Theses and Dissertations
  1. AUETD Home
  2. Browsing by Author

Browsing by Author "Hoffman, Dean G."

Now showing items 1-5 of 5

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 ...

Factor Pair Latin Squares 

Hammer, James, III (2015-05-05)
Sudoku has risen in popularity over the past few years. The rules are simple, yet the solutions are often less than trivial. Mathematically, these puzzles are interesting in their own right. This dissertation will use ...

Gregarious Path Decomposition of Some Graphs 

Yuceturk, Guven (2011-07-21)
Let G be a simple graph and f(v) a positive integer for each vertex v of G. Form G^f by replacing each v by a set F(v) of f(v) vertices, and each edge uv by complete bipartite graph on bipartition (F(u); F(v)). Can we ...

On the existence of even and k-divisible-matchings 

Moore, Emilia (2008-05-15)
The concept of an an even matching was first introduced by Billington and Hoffman. They were used to find gregarious 4-cycle decompositions of $K_{8t(a),b}$ with a and b odd. Their paper contains even matchings of type ...