J4 ›› 2011, Vol. 24 ›› Issue (4): 73-77.

• Content • Previous Articles     Next Articles

Cycle extendability of connected and P3-locally connected [5,3]-graphs

 HUANG Sha-Sha, WANG Jiang-Lu   

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

Abstract:

         A graph G is a [s,t]-graph if there are at least t edges in every included subgraph of s vertices. Let H be a graph. A graph G is H-locally connected if G[N(F)-V(F)] is connected for its any subgraph F isomorphic to H. This paper proves that a connected and P3 locally connected [5,3]-graph,whose order n≥8 ,is 1-2 extendable. (P3 is an order 3 path.)

Key words: [s,t]-graph, H-locally connected graph, 1-2 extendable graph

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