ALMOST VERTEX BIPANCYCLIC GRAPHS

CSpace

	ALMOST VERTEX BIPANCYCLIC GRAPHS
	LU, TJ ; REN, H
	1994-06-01
发表期刊	ARS COMBINATORIA
ISSN	0381-7032
卷号	37 页码:113-119
摘要	A connected balanced bipartite graph G on 2 n vertices is almost vertex bipancyclic (i.e. G has cycles of length 6,8,...,2n through each vertex of G ) if it satisfies the following property P(n): if x, y is-an-element-of V(G) and d (x, y) = 3 then d (x) + . d (y) greater-than-or-equal-to n + 1. Furthermore, all graphs except C6 on 2 n (n greater-than-or-equal-to 3) vertices satisfying P(n) are bipancyclic (i.e. there are cycles of length 4,6,..., 2 n in the graph).
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:A1994NY75500009
出版者	CHARLES BABBAGE RES CTR
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/28536
专题	中国科学院数学与系统科学研究院
作者单位	1.CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA 2.YUNNAN NORMAL UNIV,DEPT MATH,KUNMING,PEOPLES R CHINA
推荐引用方式 GB/T 7714	LU, TJ,REN, H. ALMOST VERTEX BIPANCYCLIC GRAPHS[J]. ARS COMBINATORIA,1994,37:113-119.
APA	LU, TJ,&REN, H.(1994).ALMOST VERTEX BIPANCYCLIC GRAPHS.ARS COMBINATORIA,37,113-119.
MLA	LU, TJ,et al."ALMOST VERTEX BIPANCYCLIC GRAPHS".ARS COMBINATORIA 37(1994):113-119.