Semester
Spring
Date of Graduation
2002
Document Type
Thesis
Degree Type
MS
College
Statler College of Engineering and Mineral Resources
Department
Lane Department of Computer Science and Electrical Engineering
Abstract
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it is the degree sequence of a simple graph of order n and such graph is referred to as a realization of pi.;Let H be a simple graph. A graphic sequence pi is said to be potentially H-graphic if it has a realization G containing H as its subgraph.;In this paper, we characterize the potentially Ck graphic sequence for k = 3, 4, 5. These characterizations imply theorems due to P. Erdos, M. S. Jacobson and J. Lehel, R. J. Gould, M. S. Jacobson and J. Lehel and C. H. Lai.
Recommended Citation
Luo, Rong, "Degree sequences" (2002). Graduate Theses, Dissertations, and Problem Reports (ETD). 1235.
https://researchrepository.wvu.edu/etd/1235