Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Mostafa Blidia"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 95-103 (2021)
Let D=(V,A) be a digraph of order n = |V|. A Roman dominating function of a digraph D is a function f : V → {0,1,2} such that every vertex u for which f(u) = 0 has an in-neighbor v for which f(v) = 2. The weight of a Roman dominating function is th
Externí odkaz:
https://doaj.org/article/7ef95957ff334d99acf17f66b919dc2a
Autor:
Ahmed Bouchou, Mostafa Blidia
Publikováno v:
Opuscula Mathematica, Vol 36, Iss 5, Pp 563-574 (2016)
A \(2\)-rainbow dominating function of a graph \(G\left(V(G),E(G)\right)\) is a function \(f\) that assigns to each vertex a set of colors chosen from the set \(\{1,2\}\) so that for each vertex with \(f(v)=\emptyset\) we have \({\textstyle\bigcup_{u
Externí odkaz:
https://doaj.org/article/b2ddd249e94a4520bc92bdaf83f1ada3
Publikováno v:
Opuscula Mathematica, Vol 35, Iss 2, Pp 171-180 (2015)
A \(b\)-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the \(b\)-chromatic number \(b(G)\) of a graph \(G\) is the largest integer \(k\) such that \(G
Externí odkaz:
https://doaj.org/article/932a594bda8044bbb0591a8d5717b7ce
Publikováno v:
Opuscula Mathematica, Vol 33, Iss 1, Pp 19-28 (2013)
A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that has neighbors of all other colors. The b-chromatic number of a graph G is the largest k such that G admits a b-coloring with k colors. A graph G
Externí odkaz:
https://doaj.org/article/4c83418f546142f8803586a4efd66e56
Publikováno v:
Opuscula Mathematica, Vol 33, Iss 4, Pp 641-646 (2013)
Let \(G=\left(V,E\right)\) be a graph and let \(k\) be a positive integer. A subset \(D\) of \(V\left( G\right) \) is a \(k\)-dominating set of \(G\) if every vertex in \(V\left( G\right) \backslash D\) has at least \(k\) neighbours in \(D\). The \(k
Externí odkaz:
https://doaj.org/article/87eebc52217d4d86852bd9f6dec04ac4
Autor:
Mostafa Blidia, Rahma Lounes
Publikováno v:
Opuscula Mathematica, Vol 29, Iss 1, Pp 5-14 (2009)
A set \(D\) of vertices in a graph \(G\) is a locating-dominating set if for every two vertices \(u\), \(v\) of \(G \setminus D\) the sets \(N(u) \cap D\) and \(N(v) \cap D\) are non-empty and different. In this paper, we characterize vertices that a
Externí odkaz:
https://doaj.org/article/7fe543f666e243969333b80b451094d3
Autor:
Mostafa Blidia, Mustapha Chellali
Publikováno v:
Opuscula Mathematica, Vol 27, Iss 2, Pp 181-185 (2007)
In this note we give a generalized version of Vizing's conjecture concerning the distance domination number for the cartesian product of two graphs.
Externí odkaz:
https://doaj.org/article/57e98f2b08db4d819f5e876fcf426dcd
Note: Please see pdf for full abstract with equations. Let D = (V,A) be a digraph. A double Roman dominating function on a digraph D is a function ƒ :V → {0, 1, 2, 3} such that every vertex u for which ƒ(u) = 0 has an in-neighbor v for which ƒ(v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a19d7b660a64a0f53131c3126c56bdf7
https://doi.org/10.21203/rs.3.rs-2489657/v1
https://doi.org/10.21203/rs.3.rs-2489657/v1
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 95-103 (2021)
Let D=(V,A) be a digraph of order n = |V|. A Roman dominating function of a digraph D is a function f : V → {0,1,2} such that every vertex u for which f(u) = 0 has an in-neighbor v for which f(v) = 2. The weight of a Roman dominating function is th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63482d3663903300b55ab07e06712fe7
https://ejgta.org/index.php/ejgta/article/view/571
https://ejgta.org/index.php/ejgta/article/view/571
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 771-785 (2020)
A Roman dominating function on a graph G = (V, E) is a function f:V (G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value w(f) = Σu∈
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ab6895f8c979fc497f829a4b2e8bfaa
https://doaj.org/article/925437db9f9e445599b163137b971ef9
https://doaj.org/article/925437db9f9e445599b163137b971ef9