[1]张艳芳.6长圈带2条悬边的8阶连通图的图设计[J].江西师范大学学报(自然科学版),2012,(01):51-53.
　ZHANG Yan-fang.The Graph Designs of Connected Graphs with 8 Vertices Obtained by Adding Two Pendant Edges from a Cycle of Length 6[J].Journal of Jiangxi Normal University:Natural Science Edition,2012,(01):51-53.
点击复制

6长圈带2条悬边的8阶连通图的图设计()
分享到：

《江西师范大学学报》（自然科学版）[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2012年01期
页码:
51-53
栏目:
出版日期:
2012-01-01

文章信息/Info

Title:
The Graph Designs of Connected Graphs with 8 Vertices Obtained by Adding Two Pendant Edges from a Cycle of Length 6
作者:
张艳芳
河北经贸大学数学与统计学学院, 河北 石家庄 050061
Author(s):
ZHANG Yan-fang
关键词:
图设计;  带洞图设计;  连通图
Keywords:
graph design;  holey graph design;  connected graph
分类号:
O 157
文献标志码:
A
摘要:
构造了所需的带洞图设计, 再结合一些小阶数的图设计的存在性, 得到了关于图Gi (i=1,2,3,4)的图设计(v, Gi ,1)-GD的存在谱, 其中图Gi (i=1,2,3,4)是给6长圈增加2条悬挂边所得的8阶连通图, 且G1, G2, G3, G4互不同构.
Abstract:
The needed holey graph designs are constructed. The existence spectrum of (v, Gi ,1)-GD is obtained by combining with the existence of some graph designs of small orders, i=1,2,3,4, where G1, G2, G3, G4 are the connected graphs of order 8 obtained by adding two pendant edges from a cycle of length 6 and G1, G2, G3, G4 are not isomorphic each other.

参考文献/References:

[1] Heinrich K. Path-decompositions [J]. Le Matematiche, 1992, 47(2): 241-258.
[2] Bosák J. Decompositions of graphs [M]. Boston: Kluwer Academic Publishers, 1990.
[3] Bermond J C, Schonheim J. G-decompositions of Kn, where G has four vertices or less [J]. Discrete Math, 1977, 19(2): 113-120.
[4] Bermond J C, Huang C, Rosa A, et al. Decomposition of complete graphs into isomorphic subgraphs with five vertices [J]. Ars Combinatoria, 1980, 10: 211-254.
[5] Yin Jianxing, Gong Busheng. Existence of G-designs with |V(G)|=6 [J]. Combinatorial Designs and Application, 1998, 126: 201-218.
[6] Kang Qingde, Zuo Huijuan, Zhang Yanfang. Decompositions of into k-circuits with one chord [J]. Australasian Journal of Combinatorics, 2004, 30: 229-246.
[7] Kang Qingde, Du Yanke, Tian Zihong. Decomposition of into some graph with six vertices and seven edges [J]. Journal of Statistical Planning and Inference, 2006, 136(4): 1394-1409.
[8] Kang Qingde, Yuan Landang, Liu Shuxia. Graph designs for all graphs with six vertices and eight edges [J]. Acta Mathematicae Applicatae Sinica, 2005, 21(3): 469-484.
[9] Kang Qingde, Zhao Hongtao, Ma Chunping. Graph designs for nine graphs with six vertices and nine edges [J]. Ars Combinatoria, 2008, 88: 379-396.
[10] Kang Qingde, Ma Chunping, Zhao Hongtao. G-decomposition of , where G has six vertices and nine edges [J]. Ars Combinatoria, 2010, 94: 485-510.
[11] Gao Yinzhi, Zuo Huijuan, Kang Qingde. Decomposition of into the graphs with 7 points, 7 edges and an even-circle [J]. Acta Mathematicae Applicatae Sinica, 2004, 27(4): 646-658.
[12] 张艳芳, 梁志和. 拟群在构作图Km+2\Km的图设计中的应用 [J]. 江西师范大学学报: 自然科学版, 2008, 32(5): 579-581.
[13] 李明超, 康庆德, 霍京京. 完全图Kv的8长圈最大填充设计 [J]. 河北师范大学学报: 自然科学版, 2009, 33(4): 421-424.
[14] 苏国强, 刘红娟, 王立冬. 一个6点9边图的图设计 [J]. 纯粹数学与应用数学, 2011, 27(2): 143-147.

更新日期/Last Update: 1900-01-01