2-limited dominating broadcasts on cubic graphs without induced 4-cycles

DOI10.1016/j.dam.2022.12.013zbMath1506.05059OpenAlexW4312115723MaRDI QIDQ2112664

Boram Park

Publication date: 11 January 2023

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.013

zbMATH Keywords

cubic graphdominating broadcast2-limited dominating broadcast

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Optimal broadcast domination in polynomial time
• Radial trees
• \(k\)-broadcast domination and \(k\)-multipacking
• 2-limited broadcast domination in subcubic graphs
• On domination in connected cubic graphs
• Broadcasts in graphs
• LIMITED DOMINATING BROADCAST IN GRAPHS
• Broadcast Domination in Graphs
• General bounds on limited broadcast domination
• Paths, Stars and the Number Three
• Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
• A linear‐time algorithm for broadcast domination in a tree

This page was built for publication: 2-limited dominating broadcasts on cubic graphs without induced 4-cycles