Record Details
On the enumeration of certain equivalence classes of Euler paths of full graphs
ScholarsArchive at Oregon State University
| Field | Value |
|---|---|
| Title | On the enumeration of certain equivalence classes of Euler paths of full graphs |
| Names |
Prothero, Stephen Kerron
(creator) Stalley, Robert D. (advisor) |
| Date Issued | 1963-05-14 (iso8601) |
| Note | Graduation date: 1963 |
| Abstract | This thesis treats the problem of enumerating equivalence classes of Euler paths of full graphs. A full graph is a complete, unordered, graph with no loops or repeated edges. Two Euler paths are equivalent if and only if one can be transformed into the other by a finite sequence of rotations and reflections of the path and permutations of its vertices. We obtain the number of equivalence classes for full graphs on 3 and 5 vertices but obtain only partial results for full graphs on 7 vertices. We prove theorems which enable us to obtain representatives of all equivalence classes with relatively few repetitions for any full graph. Finally we prove a monotoneity theorem for the number of equivalence classes. |
| Genre | Thesis/Dissertation |
| Topic | Graphic methods |
| Identifier | http://hdl.handle.net/1957/48754 |
