Infectious power domination of hypergraphs

DOI10.1016/J.DISC.2019.111724zbMath1431.05110arXiv1910.03038OpenAlexW2990903206WikidataQ126770079 ScholiaQ126770079MaRDI QIDQ2286585

Beth Bjorkman

Publication date: 22 January 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.03038

zbMATH Keywords

hypergraphpower dominationinfection number

Mathematics Subject Classification ID

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

Related Items (3)

Linear-time algorithm for paired-domination on distance-hereditary graphs ⋮ Unnamed Item ⋮ Generalized power domination in claw-free regular graphs

Cites Work

• Unnamed Item
• Hypergraphs with large domination number and with edge sizes at least three
• On the \({k}\)-power domination of hypergraphs
• Infection in hypergraphs
• Hypergraph theory. An introduction
• Zero forcing and maximum nullity for hypergraphs
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Domination in Graphs Applied to Electric Power Networks
• The PMU Placement Problem

This page was built for publication: Infectious power domination of hypergraphs