2个七点七边图的图填充与图覆盖设计  

Graph Packing and Covering Designs of Graphs with Seven Vertices and Seven Edges

作　　者：袁兰党[1] 杨立宝 谷丽彦[1] YUAN Landang;YANG Libao;GU Liyan(School of Mathematical Sciences,Hebei Normal University,Hebei Shijiazhuang 050024,China;School of Mathematics and Information Technology,Xingtai University,Hebei Xingtai 054001,China)

机构地区：[1]河北师范大学数学科学学院,河北石家庄050024 [2]邢台学院数学与信息技术学院,河北邢台054001

出　　处：《河北师范大学学报（自然科学版）》2022年第6期541-545,共5页Journal of Hebei Normal University：Natural Science

基　　金：河北省自然科学基金(2022205024)。

摘　　要：研究了2个七点七边图的图填充和图覆盖设计,首先利用带洞图设计给出递归构造,进一步直接构作出递归构造所需的基础构造,最后证明了正则图填充和图覆盖设计的存在性.In this paper,we discussed graph packing and covering designs of λ K_(v) into graphs with seven vertices and seven edges.First,we gave a recursive structure by holy graph design,and then constructed all designs wanted in recursive structure.Finally,we proved the existence of optimal graph packing and covering designs.

关 键 词：图填充设计 图覆盖设计 带洞图设计 

分 类 号：O157[理学—数学]