Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Sakineh Nazari-Moghaddam"'
Publikováno v:
Mathematics Interdisciplinary Research, Vol 5, Iss 3, Pp 259-277 (2020)
Let G=(V,E) be a finite and simple graph of order n and maximum degree Δ(G). A strong Roman dominating function on a graph G is a function f:V (G)→{0, 1,… ,[Δ(G)/2 ]+ 1} satisfying the condition that every
Externí odkaz:
https://doaj.org/article/48db3b307647419baa3db5a6116166d9
Autor:
Pu Wu, Huiqin Jiang, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Zehui Shao, Lutz Volkmann
Publikováno v:
Mathematics, Vol 7, Iss 9, p 820 (2019)
A set S ⊆ V ( G ) in a graph G is a dominating set if S dominates all vertices in G, where we say a vertex dominates each vertex in its closed neighbourhood. A set is independent if it is pairwise non-adjacent. The minimum cardinality of an indepen
Externí odkaz:
https://doaj.org/article/3ee37176b0ab414eaad8ef6c7e2e3302
Autor:
Seyed Mahmoud Sheikholeslami, H. Abdollahzadeh Ahangar, Sakineh Nazari-Moghaddam, Mustapha Chellali, Jafar Amjadi
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 345-360 (2021)
A 2-rainbow dominating function (2RDF) of a graph G = (V (G), E(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 every vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::548d50ab642e4878fbcda45ccfa3e430
https://doaj.org/article/2692cb4050404d7d800eb96ce64718fb
https://doaj.org/article/2692cb4050404d7d800eb96ce64718fb
Publikováno v:
Aequationes mathematicae. 95:215-236
The total and strong version of the Roman domination number (for graphs) is introduced in this research, and the study of its mathematical properties is therefore initiated. We establish upper bounds for such a parameter, and relate it with several p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09a703a4ccd07dbd20f6208a0afdd861
https://doi.org/10.1007/s00010-021-00778-x
https://doi.org/10.1007/s00010-021-00778-x
Autor:
Hamid Reza Maimani, Farhad Rahimi Mahid, Sakineh Nazari Moghaddam, Seyed Mahmoud Sheikholeslami, Mostafa Momeni
Publikováno v:
Bulletin of the Iranian Mathematical Society. 46:543-555
For a graph $$G = (V, E)$$, a double Roman dominating function (DRDF) on G is a function $$f : V \rightarrow \{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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21c05d9971db83234e8c630e6b071c63
https://doi.org/10.1007/s41980-019-00274-8
https://doi.org/10.1007/s41980-019-00274-8
Publikováno v:
Quaestiones Mathematicae. 43:1065-1082
Let k ≥ 1 be an integer and G be a simple and finite graph with vertex set V (G). A signed Roman k-dominating function (SRkDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that (i) every vertex v with f(v) = −1 is adjacent to at lea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f5e306b0caee7feeea1a491980a7cac
https://doi.org/10.2989/16073606.2019.1600068
https://doi.org/10.2989/16073606.2019.1600068
Autor:
Pu Wu, Yuan Yan Tang, Seyed Mahmoud Sheikholeslami, Zehui Shao, Sakineh Nazari-Moghaddam, Hong Yang, Xiaosong Zhang
Publikováno v:
RAIRO - Operations Research. 53:627-643
Let k ≥ 1 be an integer and G be a simple and finite graph with vertex set V(G). A signed double Roman k-dominating function (SDRkDF) on a graph G is a function f:V(G) → {−1,1,2,3} such that (i) every vertex v with f(v) = −1 is adjacent to at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::782bde465b79702ec05da3ec4fc20e48
https://doi.org/10.1051/ro/2018043
https://doi.org/10.1051/ro/2018043
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 22:31-44
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 must have at least two neighbors assigned 2...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae8cf63da31545fc8726ce171748fb81
https://doi.org/10.1080/09720529.2019.1569833
https://doi.org/10.1080/09720529.2019.1569833
Publikováno v:
Journal of Combinatorial Optimization. 36:81-89
A double Roman dominating function (DRDF) on a graph $$G=(V,E)$$ is a function $$f : V \rightarrow \{0, 1, 2, 3\}$$ having the property that if $$f(v) = 0$$ , then vertex v must have at least two neighbors assigned 2 under f or one neighbor w with $$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d640e7c537a5838516d6fe6332fe27d
https://doi.org/10.1007/s10878-018-0286-6
https://doi.org/10.1007/s10878-018-0286-6
Autor:
H. Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Jafar Amjadi, Sakineh Nazari-Moghaddam
Publikováno v:
Iranian Journal of Science and Technology, Transactions A: Science. 43:1081-1088
A double Roman dominating function (DRDF) on a graph $$G=(V,E)$$ is a function $$f:V(G)\rightarrow \{0,1,2,3\}$$ such that (i) every vertex v with $$f(v)=0$$ is adjacent to at least two vertices assigned a 2 or to at least one vertex assigned a 3, (i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d083908336ced8b72da60578b73c913a
https://doi.org/10.1007/s40995-018-0535-7
https://doi.org/10.1007/s40995-018-0535-7