creative_2024_33_2_289_295Let 
be a graph. A set 
is a power dominating set of 
if 
observes all the vertices in 
following two rules: domination and propagation. The cardinality of a minimum power dominating set is called the power domination number. In this paper, we compute the power domination number of generalized 
-Mycielskian of a cycle, 
. We found that it depends on the numbers 
.
| Author(s) | Sreethu, K., Varghese, Seema |
|---|
Power Domination in Generalized Mycielskian of Cycles
Fixed point theorem for composition of multivalued and single-valued mappings in Banach spaces
Initial Value Problem for Hybrid Improved Conformable Fractional Differential Equations with Retardation and Anticipation
On a Subclass of Meromorphic Functions Defined by a Differential Operator on Hilbert Space
Countably Many Positive Symmetric Solutions For Sturm Liouville Type Boundary Conditions Of Second Order Iterative System
On the derived numbers of a real function
Some considerations about l'Hôpital-type rules for the monotonicity
On Minimum Second neighborhood Degree Energy of Graphs
Preserver Problems on Infinite Divisibility and Separability
A Note on Moritoh Transforms
