【摘要】 结合图的支配集与其他相关条件,证明了如下结果:(1)设G是无环连通图,如果G中含有一个子图为轮W,且V(W)={x,y1,y2,,yt}(t≥3)为图G的一个支配集,则图G是上可嵌入的.(2)设G是无环连通图,如果G中含有一个子图为完全二部图D=(X,Y;E),且V(D)=X∪Y为图G的一个支配集(其中|X|≥3,|Y|≥4),则图G是上可嵌入的.更多还原

【Abstract】 Combined with the dominate vertices set of graphs and some other conditions, the following results are provn: (1) Let G be a connected loopless graph, if G contains a subgraph W satisfing W is a wheel, and V (W ) = { x , y1, y 2, , yt }(t ≥ 3) is a dominate vertices set of G , then G is upper embeddable. (2) Let G be a connected loopless graph, if G contains a subgraph D satisfing D is a complete bipartite graph, and V ( D )= X ∪ Y is a dominate vertices set of G ( | X |≥ 3, | Y |≥ 4), then G is upper embeddable.更多还原