期刊文献+

Graph Designs for all Graphs with Six Vertices and Eight Edges 被引量:5

Graph Designs for all Graphs with Six Vertices and Eight Edges
原文传递
导出
摘要 Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32. Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2005年第3期469-484,共16页 应用数学学报(英文版)
基金 Supported by the Natural Science Foundation of China (No.10371031) and Natural Science Foundation of Hebei (No.103146).
关键词 Graph design holey graph design quasi-group Graph design, holey graph design, quasi-group
  • 相关文献

参考文献20

  • 1Alspach, B., Gavlas, H. Cycle decompositions of Kn and Kn-I. Journal of Combinatorial Theory (Series B), 21:146-155 (2000).
  • 2Bermond, J.C., Huang, C, Rosa, A., Sotteau, D. Decomposition of complete graphs into isomorphic subgraphs with five vertices. Ars Combinatoria, 10:211-254 (1980).
  • 3Bermond, J.C., Schbnheim, J. G-decomposition of Kn, where G has four vertices or less. Discrete Math.,19:113-120 (1977).
  • 4Blinco. A. On diagonal cycle systems. Australasian Journal of Combinatorics, 24:221-230 (2001).
  • 5Bosak. ,J. Decompositions of graphs, Kluwer Academic Publishers, Boston, 1990.
  • 6Chanm Y. The spectra for two classes of graph designs, Ars Combinatoria, 65:237-243 (2002).
  • 7Colbourn, C.,J., Dinitz, ,LH.(eds.) The CRC handbook of combinatorial designs. CRC Press, Boca Raton,1996.
  • 8Ge, Geunian. Existellce of holey LSSOM of type 2^n with application to G7-packing of Kv. J. Statist.Plan. Infer., 94:211-218 (2001).
  • 9Harary, F. Graph theory. Addison-Wesley, Reading, 1969.
  • 10Heinrich, K. Path-decomposition. Le Mathematics (Catania) XLVII: 241 -258 (1992).

同被引文献15

  • 1高印芝,左会娟,康庆德.含偶长圈的7点7边图的图设计[J].应用数学学报,2004,27(4):646-658. 被引量:4
  • 2Heinrich K.Path-decompositions[J].Le Matematiche,1992,47(2):241-258.
  • 3Bosák J.Decompositions of graphs[M].Boston:Kluwer Academic Publishers,1990.
  • 4Bermond J C,Schonheim J.G-decompositions of Kn,where Ghas four vertices or less[J].Discrete Math,1977,19(2):113-120.
  • 5Bermond J C,Huang C,Rosa A,et al.Decomposition of com-plete graphs into isomorphic subgraphs with five vertices[J].ArsCombinatoria,1980,10:211-254.
  • 6Yin Jianxing,Gong Busheng.Existence of G-designs with|V(G)|=6[J].Combinatorial Designs and Application,1998,126:201-218.
  • 7Kang Qingde,Zuo Huijuan,Zhang Yanfang.Decompositions ofλKv into k-circuits with one chord[J].Australasian Journal ofCombinatorics,2004,30:229-246.
  • 8Kang Qingde,Du Yanke,Tian Zihong.Decomposition ofλKvinto some graph with six vertices and seven edges[J].Journal ofStatistical Planning and Inference,2006,136(4):1394-1409.
  • 9Kang Qingde,Zhao Hongtao,Ma Chunping.Graph designs fornine graphs with six vertices and nine edges[J].Ars Combinato-ria,2008,88:379-396.
  • 10Kang Qingde,Ma Chunping,Zhao Hongtao.G-decompositionofλKv,where G has six vertices and nine edges[J].ArsCombinatoria,2010,94:485-510.

引证文献5

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部