J4 ›› 2010, Vol. 23 ›› Issue (6): 13-15.

• Content • Previous Articles     Next Articles

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

 WANG Lei, WANG Jiang-Lu   

  1. School of Mathematics,Shandong Normal University,Jinan 250014,China
  • Received:2010-06-10 Online:2010-12-20 Published:2010-12-20

Abstract:

          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 connected[4,2]graph without any isolated vertex.Graph F has an induced subgraph isomorphic to K3∨K2.

Key words: [s,t]-graphs;full cycle extendability;triangular connection

CLC Number: 

  • O157.5