J4 ›› 2011, Vol. 24 ›› Issue (1): 65-67.

• Content • Previous Articles     Next Articles

Cycle extensibility of a almost locally connected [4,2]-graph

 ZUO Cheng-Long, WANG Jiang-Lu   

  1. School of Mathematics, Shandong Normal University, Jinan 250014, China
  • Online:2011-02-20 Published:2011-02-20

Abstract:

          A graph G is a[s,t]- graph if there are at least t edges in its every included subgraph of s vertices.This paper proves that any cycle C satisfying 5≤|C|≤|G| is extendable in a almost locally connected [4,2]- graph. 

Key words: [s,t]- graph, almost locally connected graph, full cycle extendable

CLC Number: 

  • O157.5