Mustapha Chellali, Teresa W. Haynes
Abstract
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double dominating set if every vertex in G is dominated at least twice by the vertices of S. The minimum ...
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double dominating set if every vertex in G is dominated at least twice by the vertices of S. The minimum ...
Key concepts: Combinatorics, Mathematics, Vertex (graph theory), Dominating set, Domination analysis, Neighbourhood (mathematics), Graph, Mathematical analysis