Zobrazeno 1 - 10
of 106
pro vyhledávání: '"ISMAEL G. YERO"'
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:
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
Autor:
Babak Samadi, Ismael G. Yero
Publikováno v:
Mathematics, Vol 9, Iss 23, p 3148 (2021)
This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the mini
Externí odkaz:
https://doaj.org/article/40e91a0d16684da7b973c472b00a0280
Publikováno v:
Education Sciences, Vol 11, Iss 7, p 357 (2021)
This research proposes a didactic strategy to enrich the assimilation processes of the change of variable theorem in solving the definite integral. The theoretical foundations that support it are based on the contributions of social constructivism, p
Externí odkaz:
https://doaj.org/article/726a00cd9ca845dc9406104c84f4f2a8
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 3, Pp 242-250 (2017)
Given two vertices and of a nontrivial connected graph , the set consists all vertices lying on some geodesic in , including and . For , the set is the union of all sets for . A set is a total restrained geodetic set of if and the subgraphs induced b
Externí odkaz:
https://doaj.org/article/27ce01edf7d24acc8d00dd4edcfb8915
Publikováno v:
Opuscula Mathematica, Vol 36, Iss 5, Pp 575-588 (2016)
Given a graph \(G=(V,E)\), the subdivision of an edge \(e=uv\in E(G)\) means the substitution of the edge \(e\) by a vertex \(x\) and the new edges \(ux\) and \(xv\). The domination subdivision number of a graph \(G\) is the minimum number of edges o
Externí odkaz:
https://doaj.org/article/e20e4f66d36f4a8587f9eee6fd21157a
Publikováno v:
Mathematics, Vol 8, Iss 9, p 1438 (2020)
Given a graph G without isolated vertices, a total Roman dominating function for G is a function f:V(G)→{0,1,2} such that every vertex u with f(u)=0 is adjacent to a vertex v with f(v)=2, and the set of vertices with positive labels induces a graph
Externí odkaz:
https://doaj.org/article/460c5efa74d64c35b41ec6ba9ab10856