Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice

DOI10.1016/j.dam.2019.08.025zbMath1445.05078OpenAlexW2973186947MaRDI QIDQ2306596

Pamela E. Harris, Nohemi Sepulveda, Claudia Reyes Flores, Dalia K. Luque

Publication date: 23 March 2020

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

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

zbMATH Keywords

triangular gridbroadcast dominationtriangular matchstick graph

Mathematics Subject Classification ID

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

Related Items (3)

Projects in (t, r) Broadcast Domination ⋮ The \(( t , r )\) broadcast domination number of some regular graphs ⋮ Perfect domination ratios of Archimedean lattices

Cites Work

• Rainbow domination in graphs
• Hamiltonian properties of triangular grid graphs
• Domination number of the cross product of paths
• Optimal \((t, r)\) broadcasts on the infinite grid
• Independent domination in graphs: A survey and recent results
• On \((t,r)\) broadcast domination numbers of grids
• Domination in graphs with minimum degree two
• R -Domination in Graphs
• The domination numbers of the 5 × n and 6 × n grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice