We present and analyze some random procedures for the construction of small dominating sets in graphs. Several upper bounds for the domination number of a graph are derived from these procedures.
Zitier-Link kopieren
Document-Link
https://www.db-thueringen.de/receive/dbt_mods_00010403
Nutzung und Vervielfältigung: Alle Rechte vorbehalten