Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Juan Alberto Rodríguez-Velázquez"'
Publikováno v:
AIMS Mathematics, Vol 9, Iss 6, Pp 15325-15345 (2024)
Let $ V(G) $ be the vertex set of a simple and connected graph $ G $. A subset $ S\subseteq V(G) $ is a distance-equalizer set of $ G $ if, for every pair of vertices $ u, v\in V(G)\setminus S $, there exists a vertex in $ S $ that is equidistant to
Externí odkaz:
https://doaj.org/article/70d6b6dee5424215b66ee68e68df7d79
Publikováno v:
AIMS Mathematics, Vol 7, Iss 8, Pp 13763-13776 (2022)
In this article, we introduce the study of corona metric space. After discussing some basic properties of these metric spaces, such as completeness, boundedness, compactness and separability, we provide a necessary and sufficient condition for the ex
Externí odkaz:
https://doaj.org/article/a1390031d736437fbff9e8b6d9641919
Publikováno v:
AIMS Mathematics, Vol 6, Iss 7, Pp 7766-7781 (2021)
In a metric space $ (X, d) $, a line induced by two distinct points $ x, x'\in X $, denoted by $ \mathcal{L}\{x, x'\} $, is the set of points given by $ \mathcal{L}\{x, x'\} = \{z\in X:\, d(x, x') = d(x, z)+d(z, x') \text{ or }d(x, x') = |d(x, z)-
Externí odkaz:
https://doaj.org/article/5019b0df80e742c082e78d5eb6334626
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
Publikováno v:
Symmetry, Vol 13, Iss 6, p 1036 (2021)
This paper is devoted to the study of the quasi-total strong differential of a graph, and it is a contribution to the Special Issue “Theoretical computer science and discrete mathematics” of Symmetry. Given a vertex x∈V(G) of a graph G, the nei
Externí odkaz:
https://doaj.org/article/8ebfceacc3314768adf3eaf381191a3d
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 46
A wide range of parameters of domination in graphs can be defined and studied through a common approach that was recently introduced in [https://doi.org/10.26493/1855-3974.2318.fb9] under the name of w-domination, where $$w=(w_0,w_1, \dots ,w_l)$$ w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::907a549558bd5b368725a342a0836b31
https://doi.org/10.1007/s40840-023-01502-5
https://doi.org/10.1007/s40840-023-01502-5
Publikováno v:
Quaestiones Mathematicae; Vol. 45 No. 10 (2022); 1485–1500
No Abstract.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e511b53eb4f45e1afc32693834f1763
https://www.ajol.info/index.php/qm/article/view/238086
https://www.ajol.info/index.php/qm/article/view/238086