Type of Document Master's Thesis Author Hippchen, Thomas Author's Email Address thippche@student.gsu.edu URN etd-04212008-153500 Title INTERSECTIONS OF LONGEST PATHS AND CYCLES Degree Master of Science Department Mathematics and Statistics Advisory Committee
Advisor Name Title Frank Hall Committee Member Guantao Chen Committee Member Johannes Hattingh Committee Member Yi Zhao Committee Member Keywords
- Longest path
- longest cycle
- k - connected graphs
Date of Defense 2008-04-16 Availability unrestricted Abstract It is a well known fact in graph theory that in a connected graph any two longest paths must have a vertex in common. In this paper we will explore what happens when we look at k - connected graphs, leading us to make a conjecture about the intersection of any two longest paths. We then look at cycles and look at what would be needed toimprove on a result by Chen, Faudree and Gould about the intersection of two longest
cycles.
Files
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access hippchen_thomas_a_200805_master.pdf 330.96 Kb 00:01:31 00:00:47 00:00:41 00:00:20 00:00:01