摘要
令λK_v为v阶λ重完全图.本文研究了4类9点9边图G_i(i=1,2,3,4)的最优填充和最优覆盖问题,利用递归构造完全解决了完全图λK_v的最优G_(i^-)填充和最优G_(i^-)覆盖的存在性问题.
LetλKv be the complete multigraph of order v and index A.In this paper,the discussed graphs are Gi(i=1,2,3,4),where Gt are four kinds of graphs with nine vertices and nine edges.We completely solve the existence of optimal packings and coverings ofλKv with Gi(i=1,2,3,4)by using recursive construction.
作者
张艳芳
王国强
ZHANG Yanfang;WANG Guoqiang(College of Mathematics md Statistics,Hebei University of Economics and Business,Shijiazhuang,Hebei,050061,P.R.China;College of Mathematics and Information Science,Hebei Normal University,Shijiazhuang,Hebei,050024,P.R.China)
出处
《数学进展》
CSCD
北大核心
2019年第1期35-44,共10页
Advances in Mathematics（China）
基金
Supported by NSFC (No.11401158)
NSFHR (No.A2015205130)
the YPSR of HRD (No.QN2015240)
the YPSR of HUEB (No. 2014KYQ04)
