期刊文献+

六点七边图的图设计

The design of the graphs with six points and seven edges
下载PDF
导出
摘要 六点七边图(不带孤立点的简单图)共有17个图.应用GDD、加权和闭包思想给出了所有六点七边图图设计的构造方法,同时在构造G-HD(7k)(k=3,4,5,6,8)时运用了阿贝尔群的性质,简化了构造过程,并用此方法举例说明如何具体讨论六点七边图图设计的存在性问题,从而得出如下结论:满足v≥k,v(v-1)≡0(mod2e),v-1≡0(modd)且v≥14时,均存在(v,G,1)-GD,其中对v=7,v=8的情况单独讨论. There are seventeen graphs and each graph has six vertices and seven edges. The author attempts to introduce graph design method of the graphs with six vertices and seven edges by applying GDD, weight and B(K) to the paper. At the same time the author exerts the feature of Abel group to make G-HD(7~k), k=3,4,5,6,8. So the course is simplified.In the paper the author makes an example in order to illustrate the method. Consequently the central conclusion obtained is that the graph design (v,G,1)-GD exists when the graphs satisfy v≥k, v (v-1)≡0 (mod()2e), v-1≡0 (mod()d) and v≥14, on the side the graph designs are separately discussed when v=7, v=8.
出处 《扬州大学学报(自然科学版)》 CAS CSCD 2005年第1期9-13,共5页 Journal of Yangzhou University:Natural Science Edition
基金 国家自然科学基金资助项目(19071055)
关键词 六点七边图 图设计 带洞图设计 graph with six vertices and seven edges graph design graph design with holes
  • 相关文献

参考文献10

  • 1田子红,康庆德.关于K_(2,3)+e的图设计[J].河北师范大学学报(自然科学版),2002,26(1):12-17. 被引量:13
  • 2徐爱庆.关于三类六点七边图的图设计[J].南京师大学报(自然科学版),2003,26(1):23-29. 被引量:7
  • 3BERMOND J C, SCHONHEIM J. G-decomposition of K., where G has four vertices or less [J]. Discrete Math, 1977, 19(2): 113-120.
  • 4BERMOND J C, HUANG C, ROSA A, et al. Decomposition of completegraphs intoisomorphic subgraphs with five vertices [J]. Ars Combinatoria, 1980, 10: 293-318.
  • 5YIN J X, GONG B S. Existence of G-designs with |v(G) | =6 [J]. Combinatoria Designs and Applications,1988, 126: 201-218.
  • 6HANANI H. Balanced incomplete block designs [J]. Discrete Math, 1975, 11(3,4): 255-369.
  • 7COLBOURN C J, HOFFMAN D G, REES R. A new class of group divisible designs with blocksize three [J].J Combin Theory A, 1992, 59(1): 73-89.
  • 8HOFFMAN D G, KIRKPATRICK K S. G-designs of order n and index λ where G has 5 vertices or less [J].Austral J Combinatorics, 1998, 18: 13-37.
  • 9LIANG Z H. G-designs, G-packing, G-coverings of λKv with a bipartite graph G of six vertices [J]. Austral J Combinatorics, 2002, 25: 221-240.
  • 10LIANG Z H. Graph designs, packings and coverings of λKv with a graph of six vertices and containing a triangle [J]. Austral J Combinatorics, 2003, 28: 51-66.

二级参考文献4

  • 1[1]BERMOND J C,SCHONHEIM J. G-decomposition of Kn,where G has four vertices or less [J]. Discrete Math,1997,19:113-120.
  • 2[2]BERMOND J C,HUANG C, ROSA A,et al. Decomposition of complete graphs into isomorphic subgraphs withfive vertices [J]. Ars Combinatoria, 1980,10 .. 293-318.
  • 3[3]YIN Jian-xing,GONG Bu-sheng. Existence of G-Designs with |v(G)|=6 [J]. Combinatoria Designs and Applica-tions, 1998,126: 201-218.
  • 4田子红,康庆德.关于K_(2,3)+e的图设计[J].河北师范大学学报(自然科学版),2002,26(1):12-17. 被引量:13

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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