Power domination in Mycielskians of n -spiders

DOI10.1080/09728600.2023.2296501MaRDI QIDQ6643344zbMATH OpenFDO

Authors Seema Varghese, Seethu Varghese

Publication date 26 November 2024

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• Power domination in Mycielskian of spiders
• Power domination in graphs
• On the power domination number of the generalized Petersen graphs
• Power domination in graphs

Cites work

• A note on power domination in grid graphs
• A textbook of graph theory
• Connectivity of the Mycielskian of a graph
• Domination in Graphs Applied to Electric Power Networks
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• Power domination in block graphs
• Power domination in certain chemical structures
• Power domination in cylinders, tori, and generalized Petersen graphs
• Power domination in honeycomb networks
• Power domination in Knödel graphs and Hanoi graphs
• Power domination in Mycielskian of spiders
• Power Domination in Product Graphs
• Power domination of the Cartesian product of graphs
• Sur le coloriage des graphs

Cited in

(2)

• Power domination in generalized Mycielskian of cycles
• Power domination in generalized Mycielskian of spiders

This page was built for publication: Power domination in Mycielskians of n -spiders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643344)