Projects in (t, r) Broadcast Domination
From MaRDI portal
Publication:5118419
DOI10.1007/978-3-030-37853-0_8zbMath1447.05154OpenAlexW3017358676MaRDI QIDQ5118419
Pamela E. Harris, Erik Insko, Katie Johnson
Publication date: 8 September 2020
Published in: Foundations for Undergraduate Research in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-37853-0_8
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Directed domination in oriented graphs
- A greedy partition lemma for directed domination
- Optimal \((t, r)\) broadcasts on the infinite grid
- Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice
- On \((t,r)\) broadcast domination numbers of grids
- Broadcasts in graphs
- The Domination Number of Grids
- New Upper Bounds on the Distance Domination Numbers of Grids
- The domination numbers of the 5 × n and 6 × n grid graphs
This page was built for publication: Projects in (t, r) Broadcast Domination