The domination number of Cartesian product of two directed paths
نویسندگان
چکیده
منابع مشابه
The domination number of Cartesian product of two directed paths
4 Let γ(Pm2Pn) be the domination number of the Cartesian product of directed paths Pm and Pn for m,n ≥ 2. In [13] Liu and al. determined the value of γ(Pm2Pn) 6 for arbitrary n and m ≤ 6. In this work we give the exact value of γ(Pm2Pn) for any m,n and exhibit minimum dominating sets. 8 AMS Classification[2010]:05C69,05C38. 10
متن کامل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 the Domination Number of Cartesian Products of Two Directed Paths
Let D = (V, A) be a directed graph of order p. A subset S of the vertex set V(D) is a dominating set of D if for each vertex v∈D – S there exists a vertex u∈S such that (u, v) is an arc of D. The domination number of D, γ(D), is the order of a smallest dominating set of D. In this paper we calculate the domination number of the cartesian product of two directed paths Pm and Pn for general m and n.
متن کاملOn the Signed Domination Number of the Cartesian Product of Two Directed Cycles
Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A function ( ) { } − : 1,1 f V D → is called a signed dominating function (SDF) if [ ] ( ) 1 D f N v − ≥ for each vertex v V ∈ . The weight ( ) f ω of f is defined by ( ) ∑ v V f v ∈ . The signed domination number of a digraph D is ( ) ( ) { } γ ω = min is an SDF of s D f f D . Let Cm × Cn denotes the cartesian produ...
متن کاملTotal Domination Number of Cartesian Product Networks
Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2012
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-012-9494-7