Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Hossein Abdollahzadeh Ahangar"'
Publikováno v:
Transactions on Combinatorics, Vol 9, Iss 4, Pp 201-210 (2020)
A 2-rainbow dominating function (2RDF) of a graph $G$ is a function $f$ from the vertex set $V(G)$ to the set of all subsets of the set $\{1,2\}$ such that for any vertex $v\in V(G)$ with $f(v)=\emptyset$ the condition $\bigcup_{
Externí odkaz:
https://doaj.org/article/1c26d94c80484b50a02299a0d15674ad
Publikováno v:
Transactions on Combinatorics, Vol 5, Iss 3, Pp 1-9 (2016)
A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$. A graph $G$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (G - x) < gamma_{t}^{k}(G)
Externí odkaz:
https://doaj.org/article/fa700fb1a63a4cdd95d51aa044c792c0
Autor:
Nafiseh Ebrahimi, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami
Publikováno v:
RAIRO - Operations Research. 57:1195-1208
For an integer k ≥ 1, a Roman {k}-dominating function (R{k}DF) on a graph G = (V, E) is a function f : V → {0, 1, …, k} such that for every vertex v ∈ V with f(v) = 0, ∑u∈N(v) f(u) ≥ k, where N(v) is the set of vertices adjacent to v. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41fe96d32b57a0d9167aa0eb31ad64fb
https://doi.org/10.1051/ro/2023058
https://doi.org/10.1051/ro/2023058
Autor:
Seyed Mahmoud Sheikholeslami, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Maryam Hajjari
Publikováno v:
Bulletin of the Iranian Mathematical Society. 48:1111-1119
For a graph $$\Gamma $$ , let $$\gamma (\Gamma ),$$ $$\gamma _{t}(\Gamma )$$ , and $$\gamma _{tR2}(\Gamma )$$ denote the domination number, the total domination number, and the total Roman $$\{2\}$$ -domination number, respectively. It was shown in A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::137562afa5cc3944c6ab4aca06886705
https://doi.org/10.1007/s41980-021-00565-z
https://doi.org/10.1007/s41980-021-00565-z
Autor:
Saeed Kosari, Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Vladimir Samodivkin, Mustapha Chellali, Hossein Abdollahzadeh Ahangar
Publikováno v:
RAIRO - Operations Research. 55:S1411-S1423
Let G = (V, E) be a simple graph with vertex setxs V and edge set E. A mixed Roman dominating function of G is a function f : V ∪ E → {0, 1, 2} satisfying the condition that every element x ∈ V ∪ E for which f(x) = 0 is adjacent or incident t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f031d5ad28db566b9bd3d4170b87b836
https://doi.org/10.1051/ro/2020038
https://doi.org/10.1051/ro/2020038
Publikováno v:
Discrete Applied Mathematics. 257:1-11
A signed double Roman dominating function (SDRDF) on a graph G = ( V , E ) is a function f : V ( G ) → { − 1 , 1 , 2 , 3 } such that (i) every vertex v with f ( v ) = − 1 is adjacent to at least two vertices assigned a 2 or to at least one vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39418d97050a909134f8777085ffae3e
https://doi.org/10.1016/j.dam.2018.09.009
https://doi.org/10.1016/j.dam.2018.09.009
Publikováno v:
Filomat. 33:121-134
In this paper we continue the study of signed double Roman dominating functions in graphs. A signed double Roman dominating function (SDRDF) on a graph G = (V,E) is a function f : V(G) {-1,1,2,3} having the property that for each v V(G), f [v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::613c5ccaeb410d4a1cb637dbdef0a655
https://doi.org/10.2298/fil1901121a
https://doi.org/10.2298/fil1901121a
Publikováno v:
Electronic Journal of Graph Theory and Applications. 10:447
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42283ac9b7634415654f2db3ed4c1bfe
https://doi.org/10.5614/ejgta.2022.10.2.8
https://doi.org/10.5614/ejgta.2022.10.2.8
Publikováno v:
Discrete Applied Mathematics. 232:1-7
A double Roman dominating function (DRDF) on a graph G = ( V , E ) is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that if f ( v ) = 0 , then vertex v has at least two neighbors assigned 2 under f or one neighbor w with f ( w ) =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca4478fa85c5ad80e5f82f66f78accfb
https://doi.org/10.1016/j.dam.2017.06.014
https://doi.org/10.1016/j.dam.2017.06.014
Publikováno v:
Iranian Journal of Science and Technology, Transactions A: Science. 41:473-480
A geodetic set S in a graph G is called a total restrained geodetic set if the induced subgraphs G[S] and $$G[V-S]$$ have no isolated vertex. The minimum cardinality of a total restrained geodetic set in G is the total restrained geodetic number and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a455ad07c7d73f4300b518091a353459
https://doi.org/10.1007/s40995-017-0158-4
https://doi.org/10.1007/s40995-017-0158-4