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.
|School Location:||United States -- Georgia|
|Source:||DAI-B 72/12, Dissertation Abstracts International|
|Subjects:||Mathematics, Theoretical Mathematics|
|Keywords:||Combinatorics, Isomorphic graphs, Number of edge, Two-factor|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be