Robust domination in random graphs

DOI10.1007/S13226-023-00374-6MaRDI QIDQ6572364zbMATH OpenFDO

Authors Ghurumuruhan Ganesan

Publication date 15 July 2024

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphssparse regimerobust domination

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Modular lattices, Desarguesian lattices (06C05)

Cites work

• On the concentration of the domination number of the random graph
• On the domination number of a random graph
• Onk-tuple domination of random graphs
• 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.

This page was built for publication: Robust domination in random graphs

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