✦ LIBER ✦

On a group testing problem: Characterization of graphs with 2-complexity and maximum number of edges

✍ Scribed by Tatjana Gerzen

Book ID: 113564636
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 700 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.06.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A CHARACTERIZATION OF STABLE GRAPHS ON A

A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES

✍ Goddard, W; Winter, P A 📂 Article 📅 1986 🏛 Taylor and Francis Group 🌐 English ⚖ 144 KB

Edge orientations on cubic graphs with a

Edge orientations on cubic graphs with a maximum number of pairs of oppositely oriented edges

✍ Günther Malle 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 438 KB

We consider the problem: Characterize the edge orienta,tions of a finite graph with a maximum number of pairs of oppositely oriented edges. The probiem is solved for finite cubic graphs.

On the equivalence in complexity among t

On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph

✍ Pen Cheng; Shigeru Masuyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A note on the complexity of the maximum

A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number

✍ Sukegawa, Noriyoshi; Miyauchi, Atsushi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Some results on characterizing the edges

Some results on characterizing the edges of connected graphs with a given domination number

✍ Laura A. Sanchis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v • V-V' there exists some u• V' for which {v,u} •E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

Problem of finite axiomatizability for s

Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends

✍ A. A. Ivanov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 766 KB