Zobrazeno 1 - 10
of 595
pro vyhledávání: '"dominating function"'
Autor:
Nuttawoot Nupo, Chollawat Pookpienlert
Publikováno v:
AIMS Mathematics, Vol 9, Iss 6, Pp 14558-14573 (2024)
For a set $ X $ and a nonempty subset $ Y $ of $ X $, denote by $ T(X) $ the full transformation semigroup under the composition whose elements are functions on $ X $. Let $ Fix(X, Y) $ be the subsemigroup of $ T(X) $ containing functions $ \alpha\in
Externí odkaz:
https://doaj.org/article/80909ce6f2134a988cb0c27077a5aaff
Autor:
Lutz Volkmann
Publikováno v:
Opuscula Mathematica, Vol 44, Iss 2, Pp 285-296 (2024)
Let \(k\geq 1\) be an integer, and let \(D\) be a finite and simple digraph with vertex set \(V(D)\). A weak signed Roman \(k\)-dominating function (WSRkDF) on a digraph \(D\) is a function \(f \colon V(D)\rightarrow \{-1,1,2\}\) satisfying the condi
Externí odkaz:
https://doaj.org/article/fbea9ae4603849dea666fa19227275ef
Publikováno v:
IEEE Access, Vol 12, Pp 4575-4596 (2024)
Post-quantum cryptography (PQC) has been actively explored to meet the requirements arising with the rapid development of quantum computers. The National Institute of Standards and Technology (NIST) conducted a competition to establish the next-gener
Externí odkaz:
https://doaj.org/article/2d78a79ca18348b9955a10af847412da
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 102-109 (2024)
AbstractFor an integer [Formula: see text] an independent k-rainbow dominating function (IkRDF for short) on a graph G is a function g that assigns to each vertex a set of colors chosen from the subsets of [Formula: see text] satisfying the following
Externí odkaz:
https://doaj.org/article/2c4fb262018d4d15a9c120562c3d864d
Publikováno v:
پژوهشهای ریاضی, Vol 8, Iss 3, Pp 80-90 (2022)
Externí odkaz:
https://doaj.org/article/7d6f6964e8774cd785a08419d0fa0e62
Autor:
Poureidi Abolfazl, Rad Nader Jafari
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 709-726 (2022)
A 2-rainbow dominating function (2RDF) of a graph G is a function g from the vertex set V (G) to the family of all subsets of {1, 2} such that for each vertex v with g(v) =∅ we have ∪u∈N(v) g(u) = {1, 2}. The minimum of g(V (G)) = Σv∈V (G) |
Externí odkaz:
https://doaj.org/article/e3040e5778064b5f9ee3da431396b09e
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 115-135 (2023)
For positive integers j and k, an efficient (j, k)-dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2, . . ., j} such that the sum of function values in the closed neighbourhood of every vertex equals k. The relationship betwe
Externí odkaz:
https://doaj.org/article/421e4cc1c0d5443f9b5a3eb431a28bb6
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 340-348 (2022)
Let be a simple graph. The closed neighborhood of , denoted by , is the set . A function is a product signed dominating function, if for every vertex where . The weight of , denoted by , is the sum of the function values of all the vertices in . . Th
Externí odkaz:
https://doaj.org/article/8055fa4e181d473db799d46bcba63c29
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.