Some product graphs with power dominating number at most 2
| Autor: | Najibeh Shahbaznejad, Adel P. Kazemi, Ignacio M. Pelayo |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 3, Pp 127-131 (2021) |
| Druh dokumentu: | article |
| ISSN: | 0972-8600 2543-3474 09728600 |
| DOI: | 10.1080/09728600.2021.1972773 |
| Popis: | Let S be a set of vertices of a graph G. Let be the set of vertices built from the closed neighborhood of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in then the remaining neighbor is also in A set S is called a power dominating set of G if The power domination number of G is the minimum cardinality of a power dominating set. In this paper, we present some necessary conditions for two graphs G and H to satisfy for product graphs. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|