On the broadcast independence number of grid graph

DOI10.1007/s00373-012-1253-0zbMath1295.05173OpenAlexW2074793262MaRDI QIDQ2441352

Mohamed Zemir, Isma Bouchemakh

Publication date: 24 March 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1253-0

zbMATH Keywords

independent setbroadcastgrid graph

Mathematics Subject Classification ID

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

Related Items (8)

Algorithmic aspects of broadcast independence ⋮ Girth, minimum degree, independence, and broadcast independence ⋮ Hamiltonian cycles in linear-convex supergrid graphs ⋮ Broadcasts on paths and cycles ⋮ The Hamiltonian properties of supergrid graphs ⋮ On the broadcast independence number of caterpillars ⋮ Broadcast Domination in Graphs ⋮ Relating broadcast independence and independence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Broadcasts and domination in trees
• Optimal broadcast domination in polynomial time
• Radial trees
• Broadcasts in graphs
• A linear‐time algorithm for broadcast domination in a tree

This page was built for publication: On the broadcast independence number of grid graph