KITE-GROUP DIVISIBLE PACKINGS AND COVERINGS WITH ANY MINIMUM LEAVE AND MINIMUM EXCESS

被引：0

作者：

Yang, Yuxing ^{[1
]}

Chang, Yanxun ^{[1
]}

Wang, Lidong ^{[2
]}

机构：

[1] Beijing Jiaotong Univ, Inst Math, Beijing 100044, Peoples R China

[2] China Peoples Police Univ, Sch Intelligence Policing, Langfang 065000, Peoples R China

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2022年 / 16卷 / 04期

关键词：

Maximum group divisible packing; minimum group divisible covering; kite; leave; excess; MAXIMUM PACKINGS; DESIGNS;

D O I：

10.3934/amc.2022040

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Following Hu, Chang and Feng's work [Graphs Combin., 2016], we further subdivide the possible types of minimum leaves and minimum excesses for maximum group divisible packings and minimum group divisible coverings with kites. We show that a maximum group divisible packing and a minimum group divisible covering with kites for any given type of minimum leave and minimum excess exist, respectively.

引用

页码：1121 / 1142

页数：22

共 4 条

[1] Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess
Hu, Xijuan
Chang, Yanxun
Feng, Tao
GRAPHS AND COMBINATORICS, 2016, 32 (04) : 1423 - 1446
[2] Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess
Xijuan Hu
Yanxun Chang
Tao Feng
Graphs and Combinatorics, 2016, 32 : 1423 - 1446
[3] Group divisible (K4-e)-packings with any minimum leave
Gao, Yufeng
Chang, Yanxun
Feng, Tao
JOURNAL OF COMBINATORIAL DESIGNS, 2018, 26 (07) : 315 - 343
[4] Maximum Packings and Minimum Coverings of Kv with Octagons
Li, Mingchao
Huo, Jingjing
Gao, Zhichao
GRAPHS AND COMBINATORICS, 2009, 25 (05) : 735 - 752

← 1 →