Zobrazeno 1 - 10
of 197
pro vyhledávání: '"Sergio R. Canoy"'
Autor:
Javier Hassan, Sergio R. Canoy, Jr.
Publikováno v:
European Journal of Pure and Applied Mathematics. 16:1212-1227
In this paper, we introduce and do an initial investigation of a variant of Grundy hop domination in a graph called the connected Grundy hop domination. We show that the connected Grundy hop domination number lies between the connected hop domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a18bc8917a8c0cc97779764e565028a
https://doi.org/10.29020/nybg.ejpam.v16i2.4687
https://doi.org/10.29020/nybg.ejpam.v16i2.4687
Autor:
Javier Hassan, Sergio R. Canoy, Jr
Publikováno v:
European Journal of Pure and Applied Mathematics. 16:1154-1166
In this paper, we revisit the concepts of Grundy domination and Grundy hop domination in graphs and give some realization results involving these parameters. We show that the Grundy domination number and Grundy hop domination number of a graph G are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ca2931d915f015a5a7d063a555ad286
https://doi.org/10.29020/nybg.ejpam.v16i2.4690
https://doi.org/10.29020/nybg.ejpam.v16i2.4690
Publikováno v:
Advances and Applications in Discrete Mathematics. 38:159-178
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13000ea2aa794db914ef1cccaf22f22a
https://doi.org/10.17654/0974165823026
https://doi.org/10.17654/0974165823026
Autor:
Sergio R. Canoy, Alkajim A. Aradais
Publikováno v:
Advances and Applications in Discrete Mathematics. 31:67-85
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f148ed9b9f7840944f012c239004a23
https://doi.org/10.17654/0974165822026
https://doi.org/10.17654/0974165822026
Publikováno v:
European Journal of Pure and Applied Mathematics. 15:467-477
Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. A set S ⊆ V (G) is a hop independent set of G if any two distinct vertices in S are not at a distance two from each other, that is, dG(v, w) 6= 2 for any distinct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f428a131f05e13cbe9fcda583ea264f
https://doi.org/10.29020/nybg.ejpam.v15i2.4350
https://doi.org/10.29020/nybg.ejpam.v15i2.4350
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:638-649
A set S ⊆ V(G) of a (simple) undirected graph G is a locating-dominating set of G if for each v ∈ V(G) \ S, there exists w ∈ S such tha vw ∈ E(G) and NG(x) ∩ S= NG(y)∩S for any distinct vertices x and y in V(G) \ S. S i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::daf3de5311f9a669713808b8c4e1fb8e
https://doi.org/10.29020/nybg.ejpam.v14i3.3998
https://doi.org/10.29020/nybg.ejpam.v14i3.3998
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:695-705
In this paper, we present a way of constructing a topology on a vertex set of a graph using monophonic eccentric neighborhoods of the graph G. In this type of construction, we characterize those graphs that induced the indiscrete topology, the disc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ea9a3b5d38b7634bdd04b1af103373c
https://doi.org/10.29020/nybg.ejpam.v14i3.3990
https://doi.org/10.29020/nybg.ejpam.v14i3.3990
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 24:1989-2000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eec565e2d2536a1da046b79006bffa53
https://doi.org/10.1080/09720529.2021.1923922
https://doi.org/10.1080/09720529.2021.1923922
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:590-600
In this paper, we introduce an operator on a hyper BCI-algebra via application of aleft hyper-order. The family consisting of the images of subsets under the operator turns out to be a base for some topology on the hyper BCI-algebra. We investigate s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba18081d758443eac00b5b895456fe4d
https://doi.org/10.29020/nybg.ejpam.v14i2.3970
https://doi.org/10.29020/nybg.ejpam.v14i2.3970
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:112-125
A set S ⊆ V ( G ) is a hop dominating set of G if for each v ∈ V ( G ) \ S , there exists w ∈ S such that d G ( v, w ) = 2. It is a global hop dominating set of G if it is a hop dominatingset of both G and the complement of G . The minimum card
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5d9eed3b93f93fd8fe84594959f39a4
https://doi.org/10.29020/nybg.ejpam.v14i1.3916
https://doi.org/10.29020/nybg.ejpam.v14i1.3916