Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Signed star (j, k)-domatic numbers of digraphs

Author:
Sheikholeslami, S. M.   Volkmann, L.   


Journal:
Discrete Mathematics, Algorithms and Applications


Issue Date:
2015


Abstract(summary):

Let D be a simple digraph with arc set A(D), and let j and k be two positive integers. A function f : A(D) -> {-1, 1} is said to be a signed star j-dominating function (SSjDF) on D if Sigma(a is an element of A(v)) f(a) >=3D j for every vertex v of D, where A(v) is the set of arcs with head v. A set {f(1), f(2),..., f(d)} of distinct SSjDFs on D with the property that Sigma(d)(i=3D1) f(i)(a) <=3D k for each a is an element of A(D), is called a signed star (j, k)-dominating (SS(j, k) D) family (of functions) on D. The maximum number of functions in a SS(j, k) D family on D is the signed star (j, k)-domatic number of D, denoted by d(SS)((j, k)) (D). In this paper, we study properties of the signed star (j, k)-domatic number of a digraph D. In particular, we determine bounds on d(SS)((j, k)) (D). Some of our results extend these ones given by Sheikholeslami and Volkmann [Signed star k-domination and k-domatic number of digraphs, submitted] for the signed (j, 1)-domatic number.


Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads