On degree sums, k-factors, and Hamiltonian cycles in graphs

Date of Publication

2002

Document Type

Master's Thesis

Degree Name

Master of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Thesis Adviser

Leonor A. Ruivivar

Defense Panel Chair

Isagani B. Jos

Defense Panel Member

Yvette F. Lim
Erminda Fortes

Abstract/Summary

This paper is an exposition of the article entitled Degree Sums, k-Factors, and Hamiltonian Cycles by R. J. Faudree and J. van den Heuvel which appeared in the journal Graphs and Combinatorics in 1995.The main result of this paper is the following theorem: Let G be a 2-connected graph on n vertices that contains a k-factor and satisfies a3(G) = (3/2) (n-k). Then either is hamiltonian or k = 2 and G E F6.This paper is a generalization of several well-known results in graph theory. It also shows some of these well-known results.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG03405

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

80 leaves ; 28 cm.

Keywords

Hamiltonian graph theory; Factors (Algebra); Cycles; Algebraic

This document is currently not available here.

Share

COinS