Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Puertas, María Luz"'
Autor:
Mora, Mercè, Puertas, María Luz
Publikováno v:
Bull. Malays. Math. Sci. Soc. (2023) 46:187
The metric representation of a vertex $u$ in a connected graph $G$ respect to an ordered vertex subset $W=\{\omega_1, \dots , \omega_n\}\subset V(G)$ is the vector of distances $r(u\vert W)=(d(u,\omega_1), \dots , d(u,\omega_n))$. A vertex subset $W$
Externí odkaz:
http://arxiv.org/abs/2410.10411
Publikováno v:
Comp. Appl. Math. 41, 424 (2022)
A vertex subset S of a graph G is said to 2-dominate the graph if each vertex not in S has at least two neighbors in it. As usual, the associated parameter is the minimum cardinal of a 2-dominating set, which is called the 2-domination number of the
Externí odkaz:
http://arxiv.org/abs/2409.16703
Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, $\{\ell\}$-resolving sets were recently introduced. In this paper, we present new results
Externí odkaz:
http://arxiv.org/abs/2003.02048
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 245-275 (2023)
Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, {ℓ}-resolving sets were recently introduced. In this paper, we present new results regar
Externí odkaz:
https://doaj.org/article/745de00db76b483db159e1eb3a4121cd
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 137-149 (2023)
A dominating set of a graph is a vertex subset such that every vertex not in the subset is adjacent to at least one in the subset. In this paper we study whenever there exists a new dominating set contained (respectively, containing) the subset obtai
Externí odkaz:
https://doaj.org/article/8c7483acc841468c9a1726012631a825
Publikováno v:
Bull. Malays. Math. Sci. Soc. 43, (2020)
In this paper we present a lower bound for the domination number of the Cartesian product of a path and a cycle, that is tight if the length of the cycle is a multiple of five. This bound improves the natural lower bound obtained by using the dominat
Externí odkaz:
http://arxiv.org/abs/1811.01639
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 21 no. 1, ICGT 2018 (May 11, 2019) dmtcs:4771
Locating-dominating codes in a graph find their application in sensor networks and have been studied extensively over the years. A locating-dominating code can locate one object in a sensor network, but if there is more than one object, it may lead t
Externí odkaz:
http://arxiv.org/abs/1808.06891
Autor:
Mora, Mercè1 (AUTHOR), Puertas, María Luz2,3 (AUTHOR) mpuertas@ual.es
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. Nov2023, Vol. 46 Issue 6, p1-16. 16p.
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating $2$-broadcasts along with the associated parameter, the dom
Externí odkaz:
http://arxiv.org/abs/1710.05953
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 20 no. 2, Graph Theory (October 29, 2018) dmtcs:4054
Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and classical domination. In th
Externí odkaz:
http://arxiv.org/abs/1609.05675