广义Petersen图与C_m的卡式积的连通性

下载PDF

导出

摘要本文主要运用约化的方法证明了对广义Petersen图P(n,2),则图Cm×P(n,2)(m≥2)是Z3-连通的。

作者葛国菊马永梅

机构地区巢湖学院数学系

出处《巢湖学院学报》 2013年第6期6-8,共3页 Journal of Chaohu University

基金巢湖学院科研项目(项目编号:XLY-201204) 巢湖学院大学数学基础课程教学团队(项目编号:CH12TD01)

关键词广义PETERSEN图卡式积群流群连通

参考文献7

1Bondy, J.A.,Murth ,U.S.R.: graph Theory with Applications[M]. New york: American Elsevier,1976.
2F.Jaeger, N.Linial, C.Payan, M.Tarsi. Group connectivity of graphs-a nonhomogeneons analogue of nowhere-zero flow prop- erties[J].J.Comb.Theory,Ser., 1992,B56:165-182.
3Kochol,M.An equivalent version of the 3-flow conjeeture[J].J.Combin.Theory Ser.,2001,B83:258-261.
4Zhang ,C .Q. Integer flows and cycle covers of graphs[M].New york : Marcel Dekker,1997.
5H.-J.Lai. Group connectivity of 3-edge-connected chordal graphs[J]. Graphs and Combinatorics,2000, (16):165-176.
6M.Devos, R.Xu, and G.Yu. Nowthere-zero Z3-flows through Z3-connectivity[J].Discrete Math, 2006, (306):26-30.
7H.-J.Lai. Nowthere-zero 3-flows in locally connected graphs[J]. J.Graph Theory, 2003, (3):211-219.

巢湖学院学报

2013年第6期

内容加载中请稍等...