Zobrazeno 1 - 10
of 51
pro vyhledávání: '"N. Jafari Rad"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 966-984 (2020)
In this work, we continue to survey what has been done on the Roman domination. More precisely, we will present in two sections several variations of Roman dominating functions as well as the signed version of some of these functions. It should be no
Externí odkaz:
https://doaj.org/article/f21b2b2d56394358aa8e5fab2a7d20f3
Autor:
N. Jafari Rad, A. Poureidi
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 2, Pp 201-208 (2019)
Let $G=(V,E)$ be a graph. A subset $S\subset V$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $
Externí odkaz:
https://doaj.org/article/044ebf76298d47eab5549f60507234a4
Publikováno v:
Computer Science Journal of Moldova, Vol 27, Iss 1(79), Pp 3-22 (2019)
A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A Roman dominating function on a graph $G=(V,E)$ is a function $f: V(G) \longrightarrow \{0, 1, 2\}$ satisfying th
Externí odkaz:
https://doaj.org/article/0c66a906a2214b348262954619b20aff
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
For a graph [Formula: see text], a double Roman dominating function (DRDF) is a function [Formula: see text] having the property that if [Formula: see text] for some vertex [Formula: see text], then [Formula: see text] has at least two neighbors assi
Publikováno v:
Iranian Journal of Science and Technology, Transactions A: Science. 42:841-846
Publikováno v:
Communications in Combinatorics and Optimization, Vol 3, Iss 1, Pp 37-50 (2018)
Let $k\geq 1$ be an integer, and let $G$ be a graph. A {\it $k$-rainbow dominating function} (or a {\it $k$-RDF}) of $G$ is a function $f$ from the vertex set $V(G)$ to the family of all subsets of $\{1,2,\ldots ,k
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 39:205-218
A 2-rainbow dominating function (2RDF) on a graph $$G=(V, E)$$ is a function f from the vertex set V to the set of all subsets of the set $$\{1,2\}$$ such that for any vertex $$v\in V$$ with $$f(v)=\emptyset $$ the condition $$\bigcup _{u\in N(v)}f(u
Publikováno v:
Asian-European Journal of Mathematics. 12:2050004
A 2-rainbow edge dominating function (2REDF) of a graph [Formula: see text] is a function [Formula: see text] from the edge set [Formula: see text] to the set of all subsets of the set [Formula: see text] such that for any edge [Formula: see text] wi
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 3, Pp 585-587 (2015)
Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.