Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs

DOI10.1007/s10878-007-9115-zzbMath1218.05030OpenAlexW2125805610MaRDI QIDQ732327

Jun Guo, Xinlu Zhang, Suo-gang Gao

Publication date: 9 October 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9115-z

zbMATH Keywords

distance-regular graphpooling designsstrongly closed subgraphs\(s^e\)-disjunct matrix

Mathematics Subject Classification ID

Applications of graph theory (05C90) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Distance in graphs (05C12)

Related Items (2)

Constructing error-correcting pooling designs with symplectic space ⋮ Pooling semilattices and non-adaptive pooling designs

Cites Work

• Unnamed Item
• \(D\)-bounded distance-regular graphs
• Weak-geodetically closed subgraphs in distance-regular graphs
• Classical distance-regular graphs of negative type
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• Pooling spaces and non-adaptive pooling designs
• On strongly closed subgraphs of highly regular graphs
• Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
• New constructions of non-adaptive and error-tolerance pooling designs

This page was built for publication: Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs