|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Power domination and zero forcing | | Katherine F. Benson
; Daniela Ferrero
; Mary Flagg
; Veronika Furst
; Leslie Hogben
; Violeta Vasilevskak
; Brian Wissman
; | | Date: |
8 Oct 2015 | | Abstract: | In this paper, we study the relationship between the power domination number
and the zero forcing number of a graph $G$. We prove
$lcfrac{(G)}{Delta(G)}
clepd(G)$ where $pd(G)$ is the the power
domination number of $G$, $(G)$ is the zero forcing number of $G$, and
$Delta(G)$ is the maximum degree of $G$. We use this relationship to prove new
results for both parameters, including the power domination number for the
Cartesian product of two cycles and the zero forcing number of the
lexicographic product of regular graphs. Finally, we establish bounds on the
effect of a graph operation (vertex and edge deletion, edge contraction, and
edge subdivision) on the power domination number. | | Source: | arXiv, 1510.2421 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER