Potentially Km — G-graphical sequences: A survey
Potentially Km — G-graphical sequences: A survey
复制标题
DOI：
10.1007/s10587-009-0074-7
复制
发表时间：
2008-04
影响因子：
0.5
通讯作者：
Chunhui Lai;Lili Hu
中科院分区：
文献类型：
--
作者：
Chunhui Lai;Lili Hu
The set of all non-increasing nonnegative integer sequencesπ= (d(v1),d(v2), …,d(vn)) is denoted by NSn. A sequenceπ∈ NSnis said to be graphic if it is the degree sequence of a simple graphGonnvertices, and such a graphGis called a realization ofπ. The set of all graphic sequences in NSnis denoted by GSn. A graphical sequenceπis potentiallyH-graphical if there is a realization ofπcontainingHas a subgraph, whileπis forciblyH-graphical if every realization ofπcontainsHas a subgraph. LetKkdenote a complete graph on k vertices. LetKm−Hbe the graph obtained from Km by removing the edges setE(H) of the graphH(His a subgraph ofKm). This paper summarizes briefly some recent results on potentiallyKm−G-graphic sequences and give a useful classification for determiningσ(H, n).
