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 |
|---|
Uniqueness of Shift Polynomials and Derivative Sharing Polynomial
Diffeomorphic embedding of Higher-dimensional Hilbert Manifolds into Hilbert spaces
Approximating fixed points of the SP*-iteration for generalized nonexpansive mappings in CAT(0) spaces
Leverage Centrality in Corona Product of Cycle with some Graphs
Some new results on WS-algebras
On Duo Γ-semihyperrings
Comparative Study of Different Vacation Schemes in an Inventory System with Production and Multiple Servers
Isomorphism of Line Graph and Common Neighbourhood Graph
Timelike Bonnet surfaces on Lorentzian three-manifolds
Nonassociative van der Waerden rings
