Back to search

West Virginia University

On potentially (K(,4) - e)-graphic sequences.

Abstract

dc:description.abstract

An n-term nonincreasing nonnegative integer sequence π = (d1, d2, · · · , dn) is said to be graphic if it is the degree sequence of a simple graph G of order n, and such graph G is referred to as a realization of π. Let H be a simple graph. A graphic sequence π is said to be potentially H-graphic if it has a realization G containing H as a subgraph. In this paper, we characterize the potentially (Kk − e)-graphic sequences for k = 4 and 5 where (Kk−e) is the graph obtained from Kk by removing one edge. This characterization implies a theorem due to C. H. Lai [15] and a characterization of potentially C4-graphic sequences due to R. Luo [20].

Degree

thesis:*
Name thesis:degree_name
MS
Level thesis:degree_level
Thesis

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Niu, Jianbing
Contributors dc:contributor
  • Elaine M. Eschen

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
West Virginia University
Base URL
researchrepository.wvu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Niu, Jianbing. On potentially (K(,4) - e)-graphic sequences.. Thesis thesis, https://doi.org/10.33915/etd.10673