J4 ›› 2011, Vol. 24 ›› Issue (1): 65-67.
• Content • Previous Articles Next Articles
ZUO Cheng-Long, WANG Jiang-Lu
Online:
Published:
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
ZUO Cheng-Long, WANG Jiang-Lu. Cycle extensibility of a almost locally connected [4,2]-graph[J].J4, 2011, 24(1): 65-67.
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/I1/65
Cited