Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90365-o / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1975119263 / rank | |||
Normal rank |
Latest revision as of 11:59, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bibliography on domination in graphs and some basic definitions of domination parameters |
scientific article |
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