✦ LIBER ✦

Group testing in graphs

✍ Scribed by Justie Su-tzu Juan; Gerard J. Chang

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 259 KB
Volume: 14
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9068-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tight upper bound for group testing in

A tight upper bound for group testing in graphs

✍ Peter Damaschke 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Reconstruction of hidden graphs and thre

Reconstruction of hidden graphs and threshold group testing

✍ Huilan Chang; Hong-Bin Chen; Hung-Lin Fu; Chie-Huai Shi 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 502 KB

Testing centralization in random graphs

✍ Christian Tallberg 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 164 KB

On balance in group graphs

✍ Frank Harary; Bernt Lindström; Hans-olov Zetterström 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB

We propose a generalization of signed graphs, called group graphs. These are graphs regarded as symmetric digraphs with a group element s(u, u ) called the signing associated with each arc (u, u ) such that s(u, u)s(u, u) = 1. A group graph is ba2anced if the product s(ul, u2)s(u2, ug) -.s(u,, ul) =

Competitive group testing

✍ D.Z. Du; F.K. Hwang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 709 KB

Group labelings of graphs

✍ Paul H. Edelman; Michael Saks 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Given a graph Γ an abelian group __G__, and a labeling of the vertices of Γ with elements of __G__, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such