The 2-tuple dominating independent number of a random graph

DOI10.11575/CDM.V15I2.62639MaRDI QIDQ3303532zbMATH OpenOpenAlexFDO

Authors Bin Wang, Tao Zhang

Publication date 12 August 2020

Full work available at URL https://cdm.ucalgary.ca/article/download/62639/54221

zbMATH Keywords

concentrationdominationdominating independent number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The independent domination number of a random graph
• The independent domination number of random graph
• scientific article; zbMATH DE number 5532162
• On the Independent Domination Number of Random Regular Graphs
• Independent \((1, 2)\)-domination in graphs
• On the independence number of random graphs
• On the 2-rainbow independent domination numbers of some graphs
• The domination number of a random graph
• Dominating sets of random 2-in 2-out directed graphs
• On the domination number of a random graph

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on domination parameters in random graphs
• Independent domination in graphs: A survey and recent results
• On the domination number of a random graph
• On the number of \(k\)-dominating independent sets
• Onk-tuple domination of random graphs
• The independent domination number of a random graph
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(1)

• Onk-tuple domination of random graphs

This page was built for publication: The 2-tuple dominating independent number of a random graph

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