Xueliang Fu, Xirong Xu, Yuansheng Yang, Xue Feng
Abstract
Let G = (V (G),E(G)) be a graph. A set SV (G) is a dominating set if every vertex of V (G)−S is adjacent to some vertices in S. The domination number (G) of G is the minimum cardinality of a dominating set of G. In this paper, we study the domination number of Knodel graph W3,n and prove that for n � 8 (W(3,n)) = 2b n c + 8 <
A significance statement is not available in the OpenAlex record.
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.
Let G = (V (G),E(G)) be a graph. A set SV (G) is a dominating set if every vertex of V (G)−S is adjacent to some vertices in S. The domination number (G) of G is the minimum cardinality of a dominating set of G. In this paper, we study the domination number of Knodel graph W3,n and prove that for n � 8 (W(3,n)) = 2b n c + 8 <
Key concepts: Dominating set, Combinatorics, Domination analysis, Vertex (graph theory), Mathematics, Graph, Discrete mathematics