On the 2-domination Number of Cylinders with Small Cycles
نویسندگان
چکیده
Domination-type parameters are difficult to manage in Cartesian product graphs and there is usually no general relationship between the parameter both factors graph. This situation of domination number, Roman number or 2-domination among others. Contrary what happens with remains unknown cylinders, that is, a cycle path this paper, we will compute cylinders small cycles. We develop two algorithms involving (min, +) matrix allow us desired values γ2(Cn□Pm), 3 ≤ n 15 m 2. also pose conjecture about formula for graph class.
منابع مشابه
On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
متن کاملOn graphs with small game domination number
The domination game is played on a graph G by Dominator and Staller. The two players are taking turns choosing a vertex from G such that at least one previously undominated vertex becomes dominated; the game ends when no move is possible. The game is called D-game when Dominator starts it, and S-game otherwise. Dominator wants to finish the game as fast as possible, while Staller wants to prolo...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملOn trees with double domination number equal to 2-outer-independent domination number plus one
A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G = (V,E), a subset D ⊆ V (G) is a 2dominating set if every vertex of V (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2022
ISSN: ['1875-8681', '0169-2968']
DOI: https://doi.org/10.3233/fi-222107