Zobrazeno 1 - 10
of 80
pro vyhledávání: '"H. Abdollahzadeh Ahangar"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 3, Pp 294-301 (2024)
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighb
Externí odkaz:
https://doaj.org/article/478e3d7492d245c3b6f051c01c7a69e8
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 73-78 (2023)
AbstractIn this article, we initiate a study of hop total Roman domination defined as follows: a hop total Roman dominating function (HTRDF) on a graph [Formula: see text] is a function [Formula: see text] such that for every vertex u with f(u) = 0 t
Externí odkaz:
https://doaj.org/article/55042796e9fa4f6b9e66af0659a62c77
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 311-315 (2022)
AbstractA double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and ev
Externí odkaz:
https://doaj.org/article/89565dedd2174940823bcda06dea7350
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 206-210 (2022)
AbstractFor a graph [Formula: see text] an independent double Roman dominating function (IDRDF) is a function [Formula: see text] having the property that: (i) every vertex [Formula: see text] with f(v) = 0 has a neighbor u with f(u) = 3 or at least
Externí odkaz:
https://doaj.org/article/a60a27c4f19f4001966d231d933700de
Publikováno v:
Communications in Combinatorics and Optimization, Vol 5, Iss 2, Pp 191-206 (2020)
A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighb
Externí odkaz:
https://doaj.org/article/5c52b3d53c1449a4b8e5663260f88e1b
Publikováno v:
Journal of Mathematics, Vol 2022 (2022)
In this paper, we derive sharp upper and lower bounds on the sum γ3RG+γ3RG¯ and product γ3RGγ3RG¯, where G¯ is the complement of graph G. We also show that for each tree T of order n≥2, γ3RT≤3n+sT/2 and γ3RT≥⌈4nT+2−ℓT/3⌉, where
Externí odkaz:
https://doaj.org/article/f14fdd14c3c644aabcb5e873a29e18dd
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
A total Roman 2-dominating function (TR2DF) on a graph Γ=V,E is a function l:V⟶0,1,2, satisfying the conditions that (i) for every vertex y∈V with ly=0, either y is adjacent to a vertex labeled 2 under l, or y is adjacent to at least two vertice
Externí odkaz:
https://doaj.org/article/d9b58e3622f64840a6771e781dad7b3b
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 3, Pp 242-250 (2017)
Given two vertices and of a nontrivial connected graph , the set consists all vertices lying on some geodesic in , including and . For , the set is the union of all sets for . A set is a total restrained geodetic set of if and the subgraphs induced b
Externí odkaz:
https://doaj.org/article/27ce01edf7d24acc8d00dd4edcfb8915
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 157-164 (2016)
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∈V(G) with f(v)=0̸ the condition ⋃u∈N(v)f(u)={1,2} is fulfilled, where N(v) is th
Externí odkaz:
https://doaj.org/article/e8912dae1e4c416486973b48fbccbb2b
Publikováno v:
Discrete Applied Mathematics. 314:228-237
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3390076d402cd4b4e2a028ad365a8b1a
https://doi.org/10.1016/j.dam.2022.02.015
https://doi.org/10.1016/j.dam.2022.02.015