Maximum Packings and Minimum Coverings of Kv with Octagons

被引:8
|
作者
Li, Mingchao [1 ]
Huo, Jingjing [1 ]
Gao, Zhichao [1 ]
机构
[1] Hebei Univ Engn, Coll Sci, Handan 056038, Peoples R China
关键词
G-packing; G-covering; Leave; Repeat; Nonisomorphic graph; 4-CYCLES; GRAPHS;
D O I
10.1007/s00373-010-0879-z
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we completely settle the maximum packing and minimum covering problem of K-v with octagons for v odd, give the maximum G-packing (minimum G-covering) for all possible leaves(repeats).
引用
收藏
页码:735 / 752
页数:18
相关论文
共 50 条