Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420382 | Discrete Applied Mathematics | 2009 | 8 Pages |
Abstract
Motivated by the pooling designs over the incidence matrices of matchings with various sizes of the complete graph K2nK2n considered by Ngo and Du [Ngo and Du, Discrete Math. 243 (2003) 167–170], two families of pooling designs over the incidence matrices oftt-cliques (resp. strongly tt-cliques) with various sizes of the Johnson graph J(n,t)J(n,t) (resp. the Grassmann graph Jq(n,t)Jq(n,t)) are considered. Their performances as pooling designs are better than those given by Ngo and Du. Moreover, pooling designs associated with other special distance-regular graphs are also considered.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yujuan Bai, Tayuan Huang, Kaishun Wang,