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 independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کامل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 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...
متن کاملNote on Split Domination Number of the Cartesian Product of Paths
In this note the split domination number of the Cartesian product of two paths is considered. Our results are related to [2] where the domination number of Pm¤Pn was studied. The split domination number of P2¤Pn is calculated, and we give good estimates for the split domination number of Pm¤Pn expressed in terms of its domination number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 27 شماره
صفحات -
تاریخ انتشار 2014