Zobrazeno 1 - 3
of 3
pro vyhledávání: '"protection of graphs"'
Publikováno v:
AIMS Mathematics, Vol 6, Iss 4, Pp 3641-3653 (2021)
In this paper, we obtain closed formulae for the weak Roman domination number of rooted product graphs. As a consequence of the study, we show that the use of rooted product graphs is a useful tool to show that the problem of computing the weak Roman
Externí odkaz:
https://doaj.org/article/2a423b8179114424a9fc277f26f00579
Protection of Graphs. Generic results with emphasis on Cartesian and Lexicographic product of graphs
Autor:
Valveny Juncosa, Magdalena
Publikováno v:
O2, repositorio institucional de la UOC
Universitat Oberta de Catalunya (UOC)
Universitat Oberta de Catalunya (UOC)
Suppose that one or more entities are stationed at some of the vertices of a graph G and that an entity at a vertex can deal with a problem at any vertex in its closed neighbourhood. Informally, we say that G is protected under a given placement of e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0ec9487b424ef9cdd0ca8e7d95451b04
http://hdl.handle.net/10609/122346
http://hdl.handle.net/10609/122346
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.