{"id":{"repo_id":"wvu","oai_identifier":"oai:researchrepository.wvu.edu:etd-2238"},"canonical_url":"https://search.dev.ndltd.org/etd/wvu/oai:researchrepository.wvu.edu:etd-2238","repository":{"repo_id":"wvu","name":"West Virginia University","base_url":"https://researchrepository.wvu.edu/do/oai/"},"display":{"title":"Degree sequences","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Luo, Rong"],"institution":null,"degree_name":"MS","degree_level":"Thesis","degree_discipline":"Lane Department of Computer Science and Electrical Engineering","degree_department":null,"school":null,"contributors":["Elaine M. Eschen."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002-05-01T07:00:00Z","date_published":"2002-05-01T07:00:00Z","updated_at":"2026-07-24T06:15:31Z","subjects":["Computer science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://researchrepository.wvu.edu/etd/1235"],"render_values":[{"text":"https://researchrepository.wvu.edu/etd/1235","href":"https://researchrepository.wvu.edu/etd/1235","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.33915/etd.1235","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Elaine M. Eschen."]},{"key":"dc:creator","label":"Author","values":["Luo, Rong"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-01-17T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Lane Department of Computer Science and Electrical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://doi.org/10.33915/etd.1235","https://researchrepository.wvu.edu/etd/1235"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Degree sequences"]}]}],"canonical_facts":{"dc:contributor":["Elaine M. Eschen."],"dc:creator":["Luo, Rong"],"dc:date.available":["2019-01-17T08:00:00Z"],"dc:description.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."],"dc:identifier":["https://doi.org/10.33915/etd.1235","https://researchrepository.wvu.edu/etd/1235"],"dc:subject":["Computer science"],"dc:title":["Degree sequences"],"thesis:degree_discipline":["Lane Department of Computer Science and Electrical Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["MS"]},"updated_at":"2026-07-24T06:15:31Z"}