Nonisomorphic Maximum Packing and Minimum Covering of K
v
with 8-Cycles |
| |
Authors: | Qingde Kang Mingchao Li Jingjing Huo |
| |
Institution: | 1. Institute of Mathematics, Hebei Normal University, Shijiazhuang, 050016, People’s Republic of China 2. Department of Mathematics, Hebei University of Engineering, Handan, 056038, People’s Republic of China
|
| |
Abstract: | The maximum packing C 8-max PD(v) and minimum covering C 8-minCD(v) of K v with 8-cycles are studied, all structures with the nonisomorphic leave (excess) are presented. In Li et al. (Graphs Combin 25:735–752, 2009), C 8-max PD(v) and C 8-minCD(v) have been determined for odd v. In this paper, we introduce the enumeration of nonisomorphic ${(v,\frac{v}{2}+s)}$ -graphs (s = 4, 6), give complete solution of the maximum packing and minimum covering designs of K v with 8-cycles for any even v with all possible leaves (excesses). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|