Upper bounds on the signed (k, k)-domatic number of digraphs
نویسنده
چکیده
Let D be a simple digraph with vertex set V (D), and let f : V (D) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and ∑x∈N−[v] f(x) ≥ k for each v ∈ V (D), where N[v] consists of v and all vertices of D from which arcs go into v, then f is a signed k-dominating function on D. A set {f1, f2, . . . , fd} of distinct signed k-dominating functions on D with the property that ∑d i=1 fi(x) ≤ k for each x ∈ V (D), is called a signed (k, k)-dominating family (of functions) on D. The maximum number of functions in a signed (k, k)-dominating family on D is the signed (k, k)-domatic number of D. In this article we mainly present upper bounds on the signed (k, k)-domatic number, in particular for regular digraphs. 2010 Mathematics Subject Classification: 05C20, 05C69
منابع مشابه
Twin signed total Roman domatic numbers in digraphs
Let $D$ be a finite simple digraph with vertex set $V(D)$ and arcset $A(D)$. A twin signed total Roman dominating function (TSTRDF) on thedigraph $D$ is a function $f:V(D)rightarrow{-1,1,2}$ satisfyingthe conditions that (i) $sum_{xin N^-(v)}f(x)ge 1$ and$sum_{xin N^+(v)}f(x)ge 1$ for each $vin V(D)$, where $N^-(v)$(resp. $N^+(v)$) consists of all in-neighbors (resp.out-neighbors) of $v$, and (...
متن کاملThe signed (k, k)-domatic number of digraphs
Let D be a finite and simple digraph with vertex set V (D), and let f : V (D) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and x∈N−[v] f(x) ≥ k for each v ∈ V (D), where N−[v] consists of v and all vertices of D from which arcs go into v, then f is a signed k-dominating function on D. A set {f1, f2, . . . , fd} of distinct signed k-dominating functions on D with the property that ...
متن کاملSigned k-domatic numbers of digraphs
Let D be a finite and simple digraph with vertex set V (D), and let f : V (D) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and ∑ x∈N−[v] f(x) ≥ k for each v ∈ V (D), where N−[v] consists of v and all vertices of D from which arcs go into v, then f is a signed k-dominating function on D. A set {f1, f2, . . . , fd} of distinct signed k-dominating functions of D with the property tha...
متن کاملSigned k-domatic numbers of graphs
Let D be a finite and simple digraph with vertex set V (D), and let f : V (D)→ {−1,1} be a two-valued function. If k ≥ 1 is an integer and ∑x∈N−[v] f (x) ≥ k for each v∈V (D), where N−[v] consists of v and all vertices of D from which arcs go into v, then f is a signed k-dominating function on D. A set { f1, f2, . . . , fd} of distinct signed k-dominating functions of D with the property that ∑...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کامل