在线阅读 --自然科学版 2016年6期《3个9点9边图的图设计》
3个9点9边图的图设计--[在线阅读]
马军1, 袁兰党2
1. 河北民族师范学院 数学与计算机科学学院, 河北 承德 067000;
2. 河北师范大学 数学与信息科学学院, 河北 石家庄 050024
起止页码: 461--464页
DOI: 10.13763/j.cnki.jhebnu.nse.2016.06.001
摘要
研究了3个9点9边图的图设计.利用差方法构造了一些带洞图设计和图设计,以此作为递归基础,利用递归构造确定了它们的存在谱.

Graph Designs of Three Graphs with Nine Vertices and Nine Edges
MA Jun1, YUAN Landang2
1. College of Mathematics and Computer Science, Hebei Normal University for Nationalities, Hebei Chengde 067000, China;
2. College of Mathematics and Information Sciences, Hebei Normal University, Hebei Shijiazhuang 050024, China
Abstract:
In this paper,we discussed G-design of λKv into three graphs with nine vertices and nine edges.We constructed some holly graph designs and graph designs using difference method,and determined their existence spectrum by recursive construction.

收稿日期: 2016-1-15
基金项目: 国家自然科学基金(11401158,11171089);河北省高等学校科学技术研究项目(QN2015240)

参考文献:
[1]ALSPACH B,GAVLAS H.Cycle Decompositions of Kn and Kn-1[J].Combin Theory B,2001,81:77-99.doi:10.1006/jctb.2000.1996
[2]BOSAK J.Decompositions of Graphs.Boston:Kluwer Academic Publishers,1990.
[3]HEINRICH K.Path-decomposition[J].Le Mathematics(Catania),1992,XLVII:241-258.
[4]SAJNA M.Cycle Decompositions III:Complete Graphs and Fixed Length Cycles[J].J Combin Des,2002,10:27-78.doi:10.1002/jcd.1027
[5]KANG Q,DU Y,TIAN Z.Decompositions of λ Kv into Some Graph with Six Vertices and Seven Edges[J].J Statistical Planning and Inference,2006,136:1394-1409.doi:10.1016/j.jspi.2004.10.006