三角连通[4,2]-图的完全圈可扩性  

Fully Cycle Extendability of a Triangularly Connected[4,2]-Graphs

作　　者：王磊[1] 王江鲁[1] 

机构地区：[1]山东师范大学数学科学学院,山东济南250014

出　　处：《山东科学》2010年第6期13-15,共3页Shandong Science

摘　　要：如果G的任意s个点的导出子图中至少含有t条边,则称图G为[s,t]-图.本文证明了:若G是无孤立点的三角连通[4,2]-图,则G或者是完全圈可扩的或者同构于F.其中图F有与图■∨K2同构的导出子图.A graph G is a [s,t]-graph,if the included subgraphs of its any s vertices have at least t edges.This paper proves that G is either full-cycle extendable or isomorphic to graph F if G is a triangularly connectedgraph without any isolated vertex.Graph F has an induced subgraph isomorphic to ■∨K2.

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

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