Power domination in honeycomb networks

DOI10.1080/09720529.2011.10698353zbMath1287.94132OpenAlexW2008586686MaRDI QIDQ4648989

Daniela Ferrero, Seema Varghese, Ambat Vijayakumar

Publication date: 16 November 2012

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/1310106H_03_JDMSC_T30_14-6_pp521-529a.pdf

zbMATH Keywords

power dominationhoneycomb mesh

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)

Related Items (8)

The k-power bondage number of a graph ⋮ Power domination in Mycielskian of spiders ⋮ Power Domination Parameters in Honeycomb-Like Networks ⋮ Bondage numbers of Mycielski graphs ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Power Domination in Graphs ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Edge Forcing in Butterfly Networks

Cites Work

• Parameterized power domination complexity
• A note on power domination in grid graphs
• Power domination in graphs
• Power domination in block graphs
• Honeycomb networks
• Power Domination in Product Graphs
• Domination in Graphs Applied to Electric Power Networks

This page was built for publication: Power domination in honeycomb networks