您当前所在位置: 首页 > 学者

康庆德

  • 17浏览

  • 0点赞

  • 0收藏

  • 0分享

  • 64下载

  • 0评论

  • 引用

期刊论文

λ-packings andλ-coverings by Graphs With Six Vertices and Seven Edges

康庆德DU Yanke * KANG Qingde

数学进展,2009,38(1): 35-43,-0001,():

URL:

摘要/描述

Let λkv, be the complete multigraph with vvertices and G a finite simple graph.A G-design ( G-packing design, G-covering design) ofλkv, denoted by (v, G, λ)-GD(v, G,λ)-PD, (v, G, λ)-CD), is a pair (X, B) where X is the vertex set of Kv, and B is a collection of subgraphs of Kv, called blocks, such that each block is isomorphic to G and any two distinct vertices in Kv are joined in exactly (at most, at least) λ 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, a maximum (v, G, λ)-PD and a minimum (v, G,λ)-CD are constructed for 3 grraphs of 6 vrertices and 7 edges.

版权说明:以下全部内容由康庆德上传于   2009年07月10日 16时24分51秒,版权归本人所有。

我要评论

全部评论 0

本学者其他成果

    同领域成果