Dissertation/Thesis Abstract

On the Number of Edges in 2-factor Isomorphic Graphs
by Wrayno, Paul M., Ph.D., Emory University, 2011, 107; 3476906
Abstract (Summary)

A 2-factor is a collection of disjoint cycles in a graph that cover all vertices of that graph. A graph is called 2-factor isomorphic if all of its 2-factors are the same when viewed as a multiset of unlabeled cycles.

In this dissertation, we find the maximum size of 2-factor isomorphic graphs that contain a desired 2-factor. We are also able to give general bounds when no 2-factor is specified or any 2-factor with a fixed number of cycles is desired. We also find similar results for the special case where the underlying graph is bipartite. In each case we provide constructions that attain the maximum size.

Indexing (document details)
Advisor: Gould, Ronald
Commitee:
School: Emory University
School Location: United States -- Georgia
Source: DAI-B 72/12, Dissertation Abstracts International
Source Type: DISSERTATION
Subjects: Mathematics, Theoretical Mathematics
Keywords: Combinatorics, Isomorphic graphs, Number of edge, Two-factor
Publication Number: 3476906
ISBN: 978-1-124-92606-3
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest