科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let lambda K(nu) be the complete multigraph with nu vertices, where any two distinct vertices x and y axe joined by lambda edges {x, y}. Let G be a finite simple graph. A G-packingdesign (G-covering design) of lambda K(nu), denoted by (nu, G, lambda)-PD ((nu, G, lambda)-CD), is a pair (X, B), where X is the vertex set of K(nu) and 5 is a collection of subgraphs of K(nu), called blocks, such that each block is isomorphic to G and any two distinct vertices in K(nu) are joined in at most (at least) A blocks of B. A packing (covering) design is said to be maximum (minimum) if no other such packing (covering) design has more (fewer) blocks. In this paper, we have completely determined the packing number and covering number for the graphs with seven points, seven edges and an even circle.
- 出版日期2009-4
- 单位河北师范大学
