Abstract
dc:description.abstractA 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.
Degree
thesis:*- Name thesis:degree_name
- MS
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Lane Department of Computer Science and Electrical Engineering
- Year dc:date.available
- 2002
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Luo, Rong
- Contributors dc:contributor
-
- Elaine M. Eschen.
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Identifier
- https://researchrepository.wvu.edu/etd/1235
- OAI identifier oai:identifier
- oai:researchrepository.wvu.edu:etd-2238