scientific article; zbMATH DE number 1270237
From MaRDI portal
Publication:4236867
zbMath0917.05040MaRDI QIDQ4236867
Publication date: 28 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)
Related Items (17)
On the rainbow domination number of digraphs ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ Total double Roman domination numbers in digraphs ⋮ Bounds on the domination number of a digraph ⋮ Directed domination in oriented graphs ⋮ On the difference of the domination number of a digraph and of its reverse ⋮ Rainbow reinforcement numbers in digraphs ⋮ A greedy partition lemma for directed domination ⋮ Domination in a digraph and in its reverse ⋮ An investigation of new graph invariants related to the domination number of random proximity catch digraphs ⋮ Domination in Digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ A note on lower bounds for the total domination number of digraphs ⋮ Domination and location in twin-free digraphs ⋮ Packing and domination parameters in digraphs ⋮ On the \(k\)-domination number of digraphs ⋮ Bounds on the domination number of a digraph and its reverse
This page was built for publication:
