Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Hamilton paths"”.
-
Hamilton Paths in Generalized Petersen Graphs
… Petersen graph, <i>GP</i>(<i>n,k</i>) is Hamilton-laceable if <i>n</i> is even and <i>k</i> is odd, and it is Hamilton-connected otherwise. We take the first step in the proof of this conjecture by proving the case <i>n</i> = 3<i>k</i> + 1 and <i>k</i> greater than or equal to 1. We do …
-
Hamilton paths and 2-factors in self-complementary graphs
… Clapham showed that every SC graph has a Hamilton path. We give an algorithm for constructing such a path given the complementing permutation π. Further, we give a new lower bound for the number of such paths in a SC graph G, answering a conjecture of Koh, Rao, and Vijayan. We continue by …
-
Hamiltonicity of certain vertex symmetric graphs
… parallel architectures. In this thesis, we study Hamiltonicity in specific families of Cayley graphs and vertex symmetric graphs. In the first part of the thesis, we study the Hamiltonicity in Faber-Moore digraphs. Faber-Moore digraphs have been proposed as a method of efficient parallel …
-
Musings on matchings, matrices, and multiplicities
… These graphs, along with graphs that have Hamilton paths, are determined to have a trivial variation of the Parter-Wiener Theorem. In an effort to determine the location of Parter vertices, vertices are categorized into classes based on their effects of root multiplicities, and, in the case …