關(guān)于蘊(yùn)含K-,6--H-可圖序列的刻劃.pdf

1、漳州師范學(xué)院碩士學(xué)位論文關(guān)于蘊(yùn)含K-H-可圖序列的刻劃姓名：徐正華申請(qǐng)學(xué)位級(jí)別：碩士專業(yè)：基礎(chǔ)數(shù)學(xué)指導(dǎo)教師：賴春暉20090501iv P i : _ ? C U ? O C ? o m rAbstractGiven a simple graph G, let V (G) = {v1, v2, · · · , vn} be the vertex set of G,and let di be the degr

2、ee of vi, i = 1, 2, · · ·, n. Then π is called the graphic sequenceif π is the degree sequence of a simple graph G and G is called a realization of π. Forgiven a graph H, a graphic sequence π = (d1, d2, &#

3、183; · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Kr+1 ?H(H is a subgraph of Kr+1) denote a graph obtained from Kr+1 by removing the edgessets

4、 E(H). This thesis mainly consider the criterions on potentially K6 ?H graphicsequences in degree sequences. The following results are obtained in this thesis:1 ?We give a necessary and sufficient condition for a sequenc

5、e to be potentiallyH-graphic, we also give a necessary and sufficient condition for a sequence to begraphic if the maximal degree is at most 5.2 ? We characterize the potentially K6 ? C5-graphic sequences.3 ? We characte