完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Bai, Yujuan | en_US |
dc.contributor.author | Huang, Tayuan | en_US |
dc.contributor.author | Wang, Kaishun | en_US |
dc.date.accessioned | 2014-12-08T15:09:06Z | - |
dc.date.available | 2014-12-08T15:09:06Z | - |
dc.date.issued | 2009-07-28 | en_US |
dc.identifier.issn | 0166-218X | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/j.dam.2009.04.024 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/6934 | - |
dc.description.abstract | Motivated by the pooling designs over the incidence matrices of matchings with various sizes of the complete graph K(2n) considered by Ngo and Du [Ngo and Du, Discrete Math. 243 (2003) 167-170]. two families of pooling designs over the incidence matrices of t-cliques (resp. strongly t-cliques) with various sizes of the Johnson graph J(n. t) (resp. the Grassmann graph J(q) (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. (C) 2009 Elsevier B.V. All rights reserved. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Pooling designs | en_US |
dc.subject | s(e)-disjunct matrices | en_US |
dc.subject | Distance-regular graphs | en_US |
dc.title | Error-correcting pooling designs associated with some distance-regular graphs | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.dam.2009.04.024 | en_US |
dc.identifier.journal | DISCRETE APPLIED MATHEMATICS | en_US |
dc.citation.volume | 157 | en_US |
dc.citation.issue | 14 | en_US |
dc.citation.spage | 3038 | en_US |
dc.citation.epage | 3045 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
dc.identifier.wosnumber | WOS:000269925700004 | - |
dc.citation.woscount | 6 | - |
顯示於類別: | 期刊論文 |