[4,2]-图的圈可扩性  

Cycle Extensibility of [4,2]-graphs

作　　者：刘春房[1] 田家财[1] 黄利国[1] 

机构地区：[1]滨州学院数学与信息科学系,滨州256603

出　　处：《科学技术与工程》2010年第7期1731-1733,共3页Science Technology and Engineering

摘　　要：如果图G的任意s个点的导出子图中至少含有t条边,则称图G为[s,t]-图。证明:顶点数≥3的连通、局部连通[4,2]-图是完全圈可扩的或者同构于K2∨K3。A graph G is called [ s, t ]-graph, if there are at lesdt t edges in every included subgraphs by s vertices of G. The following result was showed：if G is connected, locally connected [ 4,2 ] -graphs with order at least 3,G is fully cycle extendable or is isomorphic to K2∨^K3.

关 键 词：[S T]-图 局部连通图 完全圈可扩 

分 类 号：O157.5[理学—数学]