Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Proving exact values for the$2$ -limited broadcast domination number on grid graphs
by
MacGillivray, Gary
, Slobodin, Aaron
, Myrvold, Wendy
in
mathematics - combinatorics
2023
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Proving exact values for the$2$ -limited broadcast domination number on grid graphs
by
MacGillivray, Gary
, Slobodin, Aaron
, Myrvold, Wendy
in
mathematics - combinatorics
2023
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Proving exact values for the$2$ -limited broadcast domination number on grid graphs
Journal Article
Proving exact values for the$2$ -limited broadcast domination number on grid graphs
2023
Request Book From Autostore
and Choose the Collection Method
Overview
We establish exact values for the$2$ -limited broadcast domination number of various grid graphs, in particular$C_m\\square C_n$for$3 \\leq m \\leq 6$and all$n\\geq m$ ,$P_m \\square C_3$for all$m \\geq 3$ , and$P_m \\square C_n$for$4\\leq m \\leq 5$and all$n \\geq m$ . We also produce periodically optimal values for$P_m \\square C_4$and$P_m \\square C_6$for$m \\geq 3$ ,$P_4 \\square P_n$for$n \\geq 4$ , and$P_5 \\square P_n$for$n \\geq 5$ . Our method completes an exhaustive case analysis and eliminates cases by combining tools from linear programming with various mathematical proof techniques.
Publisher
Discrete Mathematics & Theoretical Computer Science
Subject
This website uses cookies to ensure you get the best experience on our website.