Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Dorota Kuziak"'
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:
Communications in Combinatorics and Optimization, Vol 2, Iss 1, Pp 21-33 (2017)
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one more neighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominatin
Externí odkaz:
https://doaj.org/article/f0b458b8217042ca94ee9174e4c149fd
Autor:
Dorota Kuziak
Publikováno v:
Mathematics, Vol 8, Iss 8, p 1266 (2020)
A vertex w of a connected graph G strongly resolves two distinct vertices u,v∈V(G), if there is a shortest u,w path containing v, or a shortest v,w path containing u. A set S of vertices of G is a strong resolving set for G if every two distinct ve
Externí odkaz:
https://doaj.org/article/0613a1a7728148fc811377e4ad38bf20
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
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 3, Iss Graph Theory (2016)
Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the notion of majorities, for instance to consensus problems, diagnosis p
Externí odkaz:
https://doaj.org/article/6f8b1f3bf11b44f6bf2d32b32a5aebea
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 1, Iss Graph Theory (2014)
Graph Theory
Externí odkaz:
https://doaj.org/article/6fe44ee4d9184d258deaa9b71e8894fe
Autor:
Sandi Klavžar, Dorota Kuziak
Nonlocal metric dimension ${\rm dim}_{\rm n\ell}(G)$ of a graph $G$ is introduced as the cardinality of a smallest nonlocal resolving set, that is, a set of vertices which resolves each pair of non-adjacent vertices of $G$. Graphs $G$ with ${\rm dim}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cd4897537687e9ebe108e9954afa12a
http://arxiv.org/abs/2211.10614
http://arxiv.org/abs/2211.10614
Autor:
Ismael G. Yero, Dorota Kuziak
Publikováno v:
Open Mathematics, Vol 18, Iss 1, Pp 237-248 (2020)
Open Mathematics 2020; 18: 237–248
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
instname
RODIN: Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Universidad de Cádiz
Open Mathematics 2020; 18: 237–248
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
instname
RODIN: Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Universidad de Cádiz
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G (x, W) = d G (x, y) + d G (y, W) or d G (y, W) = d G (y, x) + d G (x, W), where d G (x, W) = min{d(x,w): w ∈ W} and d(x,w) represents the l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f53b752b7a8f46d46cafb63e2fbacbd7
https://doaj.org/article/84355dcbba4849a2b0344cb1fc398aa7
https://doaj.org/article/84355dcbba4849a2b0344cb1fc398aa7
The outer multiset dimension ${\rm dim}_{\rm ms}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that ${\rm dim}_{\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e538ba64f56b39bbd071a32dca0729c8