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 Published:2010-12-20 Online: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

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0