twin minus domination in directed graphs
نویسندگان
چکیده
let $d=(v,a)$ be a finite simple directed graph. a function$f:vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (tmdf) if $f(n^-[v])ge 1$ and $f(n^+[v])ge 1$ for eachvertex $vin v$. the twin minus domination number of $d$ is$gamma_{-}^*(d)=min{w(f)mid f mbox{ is a tmdf of } d}$. inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lower bounds for $gamma_{-}^*(d)$ interms of the order, size and maximum and minimum in-degrees andout-degrees.
منابع مشابه
Twin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملThe minus k-domination numbers in graphs
For any integer , a minus k-dominating function is afunction f : V (G) {-1,0, 1} satisfying w) for every vertex v, where N(v) ={u V(G) | uv E(G)} and N[v] =N(v)cup {v}. The minimum of the values of v), taken over all minusk-dominating functions f, is called the minus k-dominationnumber and is denoted by $gamma_k^-(G)$ . In this paper, we introduce the study of minu...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملMinus domination in graphs
We introduce one of many classes of problems which can be defined in terms of 3-valued functions on the vertices of a graph G = (V, E) of the form f : V + { 1, 0, l}. Such a fknction is said to be a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every t’ E V, ,f(N[r~])> 1, where N[a] consists of 1: and every vertex adjacent...
متن کاملglobal minus domination in graphs
a function $f:v(g)rightarrow {-1,0,1}$ is a {em minusdominating function} if for every vertex $vin v(g)$, $sum_{uinn[v]}f(u)ge 1$. a minus dominating function $f$ of $g$ is calleda {em global minus dominating function} if $f$ is also a minusdominating function of the complement $overline{g}$ of $g$. the{em global minus domination number} $gamma_{g}^-(g)$ of $g$ isdefined as $gamma_{g}^-(g)=min{...
متن کاملGlobal minus Domination in Graphs
A function f : V (G) → {−1, 0, 1} is a minus dominating function if for every vertex v ∈ V (G), ∑ u∈N [v] f(u) ≥ 1. A minus dominating function f of G is called a global minus dominating function if f is also a minus dominating function of the complement G of G. The global minus domination number γ− g (G) of G is defined as γ − g (G) = min{ ∑ v∈V (G) f(v) | f is a global minus dominating functi...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
communication in combinatorics and optimizationجلد ۱، شماره ۲، صفحات ۱۴۹-۱۶۴
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023