七点七边图的图分解

袁兰党; 杨立保; 谷丽彦; 白占立

doi:10.3969/j.issn.1000-1565.2021.04.001

河北大学学报(自然科学版) >

2021 , Vol. 41 >Issue 4: 337 - 341

DOI: https://doi.org/10.3969/j.issn.1000-1565.2021.04.001

七点七边图的图分解

袁兰党 ,
杨立保 ,
谷丽彦 ,
白占立

展开

袁兰党(1965—),女,河北辛集人,河北师范大学教授,博士, 主要从事组合设计与编码研究.E-mail:yld6@163.com

收稿日期: 2021-01-05

网络出版日期: 2021-09-03

基金资助

河北省自然科学基金资助项目(F2019205147;A2017403010);河北师范大学“六卓越一拔尖”及教学改革项目(2019XJJG048)

收起

Graph decomposition of graphs with seven vertices and seven edges

YUAN Landang ,
YANG Libao ,
GU Liyan ,
BAI Zhanli

Expand

1.Hebei Mathematics Research Center, School of Mathematical Sciences, Hebei Normal University, Shijiazhuang 050024, China; 2.School of Mathematics and Information Technology, Xingtai University, Xingtai 054001, China; 3.Editorial Department of Journal, Hebei Normal University, Shijiazhuang 050024, China

Received date: 2021-01-05

Online published: 2021-09-03

Fold

摘要

研究了2个七点七边图的图分解, 首先利用带洞图分解给出图分解存在的递归构造, 然后利用差方法构造出递归构造中所需的图分解, 最后给出了图分解的存在谱.

关键词： 图分解; 带洞图分解; 差方法

本文引用格式

袁兰党 , 杨立保 , 谷丽彦 , 白占立 . 七点七边图的图分解[J]. 河北大学学报(自然科学版), 2021 , 41(4) : 337 -341 . DOI: 10.3969/j.issn.1000-1565.2021.04.001

Abstract

G-decomposition of λK_v into graphs with seven vertices and seven edges were discussed. First, we gave a recursive structure by holy graph decomposition, and then constructed the graph decompositions wanted in recursive structure using difference method. Finally, we determined the existence spectrum of graph decomposition.

Key words： graph decomposition; holy graph decomposition; difference method

参考文献

[1] ALSPACHB, GAVLASH. Cycle decompositions of K_n and K{n}-I[J].J Combin Theory Ser B, 2001, 81(1):77-99.DOI:10.1006/jctb.2000.1996.
[2] BOSAK J. Decompositions of graphs[M]. Boston: Kluwer Academic Publishers, 1990.
[3] 刘淑霞.一个二部图的图分解[J].河北师范大学学报(自然科学版),2004,28(6):552-555.
[4] SAJNA M. Cycle decompositions Ⅲ: Complete graphs and fixed length cycles[J]. J Combin Des,2002, 10(1): 27-78.DOI:10.1002/jcd.1027.
[5] YUAN L D, KANG Q D.Graph designs for eight graphs with six vertices and eight edges(index >1)[J].Ars Combin, 2008, 87: 403-413.
[6] YUAN L D, KANG Q D. Decomposition of λK_v into five graphs with six vertices and eight edges[J].Acta Math Appl Sin Engl Ser, 2012,28(4): 823-832.DOI:10.1007/S10255-012-0191-1.
[7] COLBOURN C, DINITZ J. Handbook of combinatorial designs[M]. Boca Raton:CRC Press, 2006. (

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract

参考文献