Dominating and irredundant broadcasts in graphs

DOI10.1016/j.dam.2016.12.012zbMath1355.05189arXiv1608.00052OpenAlexW2503340257MaRDI QIDQ507582

Yong-Cai Geng, Sumit K. Garg

Publication date: 6 February 2017

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

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

zbMATH Keywords

broadcast dominationbroadcast irredundance

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Broadcasts on paths and cycles ⋮ Broadcast Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal broadcast domination in polynomial time
• Radial trees
• Contributions to the theory of domination, independence and irredundance in graphs
• New bounds for the broadcast domination number of a graph
• Broadcasts in graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Properties of Hereditary Hypergraphs and Middle Graphs
• A linear‐time algorithm for broadcast domination in a tree