Power domination in Mycielskian of spiders

DOI10.1080/09728600.2022.2082900zbMATH Open1493.05270OpenAlexW4286306607MaRDI QIDQ5097786FDOQ5097786

Authors: Seema Varghese, Seethu Varghese, A. Vijayakumar 

Publication date: 1 September 2022

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2022.2082900

Recommendations

• On the power domination number of the generalized Petersen graphs
• Power domination in graphs
• Power domination in the generalized Petersen graphs
• Power domination in graphs
• A note on power domination in grid graphs

zbMATH Keywords

spiderpower dominationMycielskian

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Sur le coloriage des graphs
• Domination in Graphs Applied to Electric Power Networks
• Power domination in graphs
• Parameterized power domination complexity
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• A note on power domination in grid graphs
• Power domination in cylinders, tori, and generalized Petersen graphs
• Power Domination in Product Graphs
• Power domination in block graphs
• Fundamentals of Computation Theory
• Computing and Combinatorics
• Power domination in Knödel graphs and Hanoi graphs
• Generalized power domination: propagation radius and Sierpiński graphs
• Power domination in honeycomb networks
• On the power domination number of de Bruijn and Kautz digraphs

Cited In (1)

• Power domination in Mycielskians of n -spiders

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)