Dominating sets of random 2-in 2-out directed graphs.

Howe, Stephen

The search session has expired. Please query the service again.

Displaying similar documents to “Dominating sets of random 2-in 2-out directed graphs.”

Encores on cores.

Cain, Julie, Wormald, Nicholas (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on the component structure in random intersection graphs with tunable clustering.

Lagerås, Andreas N., Lindholm, Mathias (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Component evolution in random intersection graphs.

Behrisch, Michael (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms

Kunal Dutta, C.R. Subramanian (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Given a simple directed graph D = (V,A), let the size of the largest induced acyclic tournament be denoted by mat(D). Let D ∈ D(n, p) (with p = p(n)) be a random instance, obtained by randomly orienting each edge of a random graph drawn from Ϟ(n, 2p). We show that mat(D) is asymptotically almost surely (a.a.s.) one of only 2 possible values, namely either b*or b* + 1, where b* = ⌊2(logrn) + 0.5⌋ and r = p−1. It is also shown that if, asymptotically, 2(logrn) + 1 is not within a distance...