K-domination number of products of two directed cycles and two directed paths
by Ramy Shaheen
International Journal of Computing Science and Mathematics (IJCSM), Vol. 9, No. 2, 2018

Abstract: Let D be a finite simple directed graph with vertex set V(D) and arc set A(D). A subset S of the vertex set V(D) is a k-dominating set (k ≥ 1) of D if for each vertex v not in S there exists k vertices {u_i, ..., u_k} ⊆ S such that (u_i, v) is an arc of D for i = 1, ..., k. The k-domination number of D, k(D), is the cardinality of the smallest k-dominating set of D. The k-domination number (k ≥ 2) of the Cartesian products of two directed cycles, two directed paths and Cartesian products of a directed path and a cycle are determined. Also, we give k-domination number (k ≥ 2) of the direct product of two directed cycles and two directed paths.

Online publication date: Mon, 14-May-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com