J4 ›› 2011, Vol. 24 ›› Issue (4): 73-77.
• Content • Previous Articles Next Articles
HUANG Sha-Sha, WANG Jiang-Lu
Online:
Published:
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
HUANG Sha-Sha, WANG Jiang-Lu. Cycle extendability of connected and P3-locally connected [5,3]-graphs[J].J4, 2011, 24(4): 73-77.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.sdkx.net/EN/
https://www.sdkx.net/EN/Y2011/V24/I4/73
Cited