| dc.creator | Anitha, J. | |
| dc.creator | Rajasingh, Indra | |
| dc.date | 2019-12-18 | |
| dc.date.accessioned | 2020-01-06T17:47:53Z | |
| dc.date.available | 2020-01-06T17:47:53Z | |
| dc.identifier | https://www.revistaproyecciones.cl/article/view/3907 | |
| dc.identifier | 10.22199/issn.0717-6279-2019-05-0064 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/122179 | |
| dc.description | A set S of vertices in a graph G is called a dominating set of G if every vertex in V (G)\S is adjacent to some vertex in S. A set S is said to be a power dominating set of G if every vertex in the system is monitored by the set S following a set of rules for power system monitoring. The power domination number of G is the minimum cardinality of a power dominating set of G. A dynamic coloring of the vertices of a graph G starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored. The initial set S is called a forcing set (zero forcing set) of G if, by iteratively applying the forcing process, every vertex in G becomes colored. The zero forcing number of G, denoted Z(G), is the minimum cardinality of a zero forcing set of G. In this paper, we obtain the zero forcing number for certain benzenoid networks.
| en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | es-ES |
| dc.relation | https://www.revistaproyecciones.cl/article/view/3907/3306 | |
| dc.rights | Derechos de autor 2019 J. Anitha, Indra Rajasingh | es-ES |
| dc.rights | http://creativecommons.org/licenses/by/4.0 | es-ES |
| dc.source | Proyecciones. Journal of Mathematics; Vol 38 No 5 (2019); 999-1010 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 38 Núm. 5 (2019); 999-1010 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.subject | Zero forcing set | en-US |
| dc.subject | Pyrene networks | en-US |
| dc.subject | Circum-pyrene networks | en-US |
| dc.subject | Circum-trizene networks | en-US |
| dc.subject | 05C69 | en-US |
| dc.subject | Dominating sets, independent sets, cliques | en-US |
| dc.subject | 05C85 | en-US |
| dc.subject | Graph algorithms | en-US |
| dc.subject | 05C90 | en-US |
| dc.subject | Applications | en-US |
| dc.subject | 05C20 | en-US |
| dc.subject | Directed graphs (digraphs), tournaments | en-US |
| dc.title | Zero forcing in Benzenoid network | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Artículo revisado por pares | es-ES |
| dc.type | text | en-US |
