Zobrazeno 1 - 10
of 938
pro vyhledávání: '"Ismael G"'
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-18 (2023)
Abstract This work focuses on the $$(k,\ell )$$ ( k , ℓ ) -anonymity of some networks as a measure of their privacy against active attacks. Two different types of networks are considered. The first one consists of graphs with a predetermined struct
Externí odkaz:
https://doaj.org/article/845505bf1f5d4f3ba8de0f6478d3d8c5
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 34-39 (2023)
Externí odkaz:
https://doaj.org/article/96cd1d5bdf954f7bae1df9f9cd098f6b
Publikováno v:
AIMS Mathematics, Vol 6, Iss 10, Pp 11084-11096 (2021)
Let $ G $ be a graph with vertex set $ V(G) $. A function $ f:V(G)\rightarrow \{0, 1, 2\} $ is a Roman dominating function on $ G $ if every vertex $ v\in V(G) $ for which $ f(v) = 0 $ is adjacent to at least one vertex $ u\in V(G) $ such that $ f(u)
Externí odkaz:
https://doaj.org/article/57419cd95dd74d7f84f4eabe98d4a234
Autor:
Johanna Karemere, Ismael G. Nana, Andrew Andrada, Olivier Kakesa, Eric Mukomena Sompwe, Joris Likwela Losimba, Jacques Emina, Aboubacar Sadou, Michael Humes, Yazoumé Yé
Publikováno v:
Malaria Journal, Vol 20, Iss 1, Pp 1-13 (2021)
Abstract Background To reduce the malaria burden and improve the socioeconomic status of its citizens, the Democratic Republic of Congo scaled up key malaria control interventions, especially insecticide-treated nets (ITNs), between 2005 and 2014. Si
Externí odkaz:
https://doaj.org/article/edc7b81333f74f59a127e373e634c631
Autor:
Ismael G. Espinoza, Felipe Franco-Gaviria, Ivonne Castañeda, Charlotte Robinson, Alex Room, Juan Carlos Berrío, Dolors Armenteras, Dunia H. Urrego
Publikováno v:
Frontiers in Ecology and Evolution, Vol 10 (2022)
Rapid climate changes and the increasing presence of humans define the Holocene Epoch (11.6 calibrated kiloyears before present – hereafter kyr BP), when biological systems have faced the most recent and abrupt environmental changes. Understanding
Externí odkaz:
https://doaj.org/article/dbceb19852f5499c9144e1131d6af5dd
Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic number of Sierpi\'nski graphs and to give a short proof that Sierpi\'n
Externí odkaz:
http://arxiv.org/abs/2409.08856
Given a graph $G$, a mutual-visibility coloring of $G$ is introduced as follows. We color two vertices $x,y\in V(G)$ with a same color, if there is a shortest $x,y$-path whose internal vertices have different colors than $x,y$. The smallest number of
Externí odkaz:
http://arxiv.org/abs/2408.03132
Publikováno v:
SSM - Mental Health, Vol 1, Iss , Pp 100003- (2021)
This study builds on a growing body of literature analyzing the education-health gradient across detailed educational categories, which documents that US working-age adults who attended college but did not earn a bachelor's degree report equal or wor
Externí odkaz:
https://doaj.org/article/c26cc6e716d447428b0c3eeb45d846a6
Autor:
Abel Cabrera Martinez, Ismael G. Yero
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 2, Pp 95-107 (2019)
Given a graph $G=(V,E)$ and a vertex $v \in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:V\rightarrow \{0,1,2\}$ be a function on $G$. The weight of $f$ is $\omega(f)=\sum_{v\in V}f(v)$ and let $V_i=\{v\in V \colon f(v)=i\}$, for
Externí odkaz:
https://doaj.org/article/abf9dc9bc0af4744a0b2d8e61ad5ff68
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 4, Iss Graph Theory (2020)
The packing number of a graph $G$ is the maximum number of closed neighborhoods of vertices in $G$ with pairwise empty intersections. Similarly, the open packing number of $G$ is the maximum number of open neighborhoods in $G$ with pairwise empty int
Externí odkaz:
https://doaj.org/article/208b4f8fc3e64c54ad3bb4841add2435