Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4212114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bibliography on domination in graphs and some basic definitions of domination parameters |
scientific article; zbMATH DE number 4212114 |
Statements
Bibliography on domination in graphs and some basic definitions of domination parameters (English)
0 references
1990
0 references
Let G(V,E) be a graph. A subset S of the vertex set V is dominating in G if every vertex from V is contained in S or adjacent to any vertex of S. Finding a minimal dominating set of a graph G is one of the basic problems in graph theory. In the paper are listed over 30 definitions close to the domination. The main part of the paper is a bibliography concerning to problems related to dominating. The list of papers contains more than 400 titles.
0 references
domination number
0 references
independence number
0 references
dominating set
0 references
bibliography
0 references
0 references
0 references
0 references
0 references
0.825535237789154
0 references
0.8011758327484131
0 references
