scientific article; zbMATH DE number 553912

MaRDI QIDQ4288082zbMATH OpenFDO

Authors Lane Clark

Publication date 21 April 1994

zbMATH Keywords

labelled treesperfect dominating setrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• On the domination number of a random graph
• On the tree domination number of a random graph.
• A note on domination parameters in random graphs
• The domination number of a random graph
• scientific article; zbMATH DE number 933213

Cited in

(16)

• On randomized stopping points and perfect graphs
• Efficient domination of the orientations of a graph
• Packing in trees
• On bondage numbers of graphs: a survey with some comments
• Packing parameters in graphs
• \([1,2]\)-sets in graphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• On the tree domination number of a random graph.
• Best and worst case permutations for random online domination of the path
• Random perfect graphs
• Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\)
• On the perfect differential of a graph
• Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
• A note on the open packing number in graphs.
• On the concentration of the domination number of the random graph
• More on limited packings in graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288082)