1. Home

Random procedures for dominating sets in graphs

Artmann, Sarah GND; Göring, Frank; Harant, Jochen GND; Rautenbach, Dieter; Schiermeyer, Ingo

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.

Preview

Category

In Series:
Preprint / Technische Universität Ilmenau, Institut für Mathematik
Vol. 08-10 (16.04.2008)
Date Created:
16.04.2008
Date Issued:
16.04.2008
PPN:
827722273
Language:
English
Type of Resource:
Text
Keywords:
domination; independence; probabilistic method
Classification:
Klasse A
Classification:
für Harvesting bereitgestellt
DDC subject of DNB:
510 Mathematics
Hosting institution:
Technische Universität Ilmenau, Fakultät für Mathematik und Naturwissenschaften

Cite

Citation style:

Artmann, Sarah / Göring, Frank / Harant, Jochen / et al: Random procedures for dominating sets in graphs. 2008.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:
All rights reserved

Export

BibTeX, MODS, MARCXML, RIS, ISI, PICA, CSV, DC