Zobrazeno 1 - 10
of 1 033
pro vyhledávání: '"Roman domination"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-12 (2024)
An outer-independent triple Roman dominating function (OI[3]RDF) on a graph [Formula: see text] is function [Formula: see text] having the property that (i) if [Formula: see text] then v must have either a neighbor assigned 4 or two neighbors one of
Externí odkaz:
https://doaj.org/article/dd8dfc2031a14f5a8db6e3381cdafa32
Publikováno v:
Zhejiang Daxue xuebao. Lixue ban, Vol 51, Iss 5, Pp 572-579 (2024)
A Roman dominating function of a graph G is a function f from the vertex set V of G to the set {0,1,2} if the open neighbor of any vertex v of G with f (v)=0 has at least one vertex u with f (u)=2. If a function f is a Roman dominating function of a
Externí odkaz:
https://doaj.org/article/30e76b49ccf141ddb20908e274bfbd72
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 21, Iss 2, Pp 171-180 (2024)
A quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighb
Externí odkaz:
https://doaj.org/article/f610d32aab714c718a924f3a453e94c9
Publikováno v:
AIMS Mathematics, Vol 9, Iss 1, Pp 594-606 (2024)
Latin square, also known as Latin square matrix, refers to a kind of $ n\times n $ matrix, in which there are exactly $ n $ different symbols and each symbol appears exactly once in each row and column. A Latin square graph $ \Gamma(L) $ is a simple
Externí odkaz:
https://doaj.org/article/626e14c15c324e98baac8bfcb032fdce
Autor:
Ahlam Almulhim
Publikováno v:
AIMS Mathematics, Vol 8, Iss 12, Pp 30895-30909 (2023)
A signed double Italian dominating function (SDIDF) on a graph $ G = (V, E) $ is a function $ f $ from $ V $ to $ \{-1, 1, 2, 3\} $, satisfying (ⅰ) $ \sum_{u\in N[v]}f(u)\ge1 $ for all $ v\in V $; (ⅱ) if $ f(v) = -1 $ for some $ v\in V $, then th
Externí odkaz:
https://doaj.org/article/62331a6da0ae471dbae743a2becdd077
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 4-10 (2024)
AbstractIn this paper, we obtain the Italian domination number, perfect Italian domination number and double Roman domination number of generalized Sierpiński graph [Formula: see text] where G is a cycle Cn, [Formula: see text] a complete bipartite
Externí odkaz:
https://doaj.org/article/3d841c3bce5c4d77bcbe56d0819f4eba
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:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 3, Pp 291-299 (2023)
AbstractFor an integer [Formula: see text] let f be a function that assigns labels from the set [Formula: see text] to the vertices of a simple graph [Formula: see text]. The active neighborhood AN(v) of a vertex [Formula: see text] with respect to f
Externí odkaz:
https://doaj.org/article/0fedb04dbe184760ade80f296e64558d