A set S ⊆ V is a power dominating set (PDS) if it can monitor all vertices of G. The minimum cardinality of a PDS of G is called the power domination number, γ P ( G ) , of G. In this paper, we study the power domination problem in Mycielskian of spiders. For a spider T, we have γ P ( T ) = 1 and γ P ( μ ( T ) ) ≤ 2 .
The power domination number of the Mycielskian of n-spiders, SPn with n > 1, lies between 1 and n, i.e., 1 ≤ γ P ( μ ( S P n ) ) ≤ n .
Jun 6, 2022 · The power domination problem in graphs consists of finding a minimum set of vertices S⊆V that monitors the entire graph G governed by two ...
The power domination problem in graphs consists of finding a minimum set of vertices S ⊆ V that monitors the entire graph G governed by two 'monitoring rules'- ...
Jun 6, 2022 · The power domination problem in graphs consists of finding a minimum set of vertices S V that monitors the entire graph G governed by two ...
Feb 14, 2024 · The power domination number of Mycielskian of spiders was also computed [13] and characterized spiders in the following way. Theorem 1.1 ...
Power domination in Mycielskian of spiders · Department of Mathematics, Government Engineering College, APJ Abdul Kalam Technological University, Thrissur, ...
People also ask
What is a spider's biggest enemy?
What is a wounded spider in graph theory?
Apr 25, 2024 · Power domination in Mycielskian of spiders. AKCE Int. J. Graphs Comb ... Power domination in Knödel graphs and Hanoi graphs. Discuss ...
The power domination number γp(G) is the minimum cardinality of a power dominating set of G. In this paper, we investigate the power domination problem in�...
