Power domination in Mycielskian of spiders
From MaRDI portal
Publication:5097786
Recommendations
Cites work
- A note on power domination in grid graphs
- Computing and Combinatorics
- Domination in Graphs Applied to Electric Power Networks
- Fundamentals of Computation Theory
- Generalized power domination: propagation radius and Sierpiński graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- On the power domination number of de Bruijn and Kautz digraphs
- Parameterized power domination complexity
- Power Domination in Product Graphs
- Power domination in Knödel graphs and Hanoi graphs
- Power domination in block graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- Power domination in graphs
- Power domination in honeycomb networks
- Sur le coloriage des graphs
This page was built for publication: Power domination in Mycielskian of spiders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097786)