Bibliography on domination in graphs and some basic definitions of domination parameters
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.
scientific article; zbMATH DE number 4212114
scientific article