On the enumeration of certain equivalence classes of Euler paths of full graphs

Graduate Thesis Or Dissertation

Public Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/70795b34z

Descriptions

Attribute Name	Values
Creator	Prothero, Stephen Kerron
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.
Resource Type	Masters Thesis
Date Available	2014-06-05T15:28:28+00:00
Date Issued	1963-05-14
Degree Level	Master's
Degree Name	Master of Arts (M.A.)
Degree Field	Mathematics
Degree Grantor	Oregon State University
Commencement Year	1963
Advisor	Stalley, Robert D.
Academic Affiliation	Mathematics
Non-Academic Affiliation	Oregon State University. Graduate School
Subject	Topology Graphic methods
Rights Statement	Copyright Not Evaluated
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Digitization Specifications	File scanned at 300 ppi using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces	http://hdl.handle.net/1957/48754

Parents:

This work has no parents.

In Collection:

Thumbnail	Title	Date Uploaded	Visibility	Actions
	ProtheroStephenK1963.pdf	2017-08-09	Public	Download