Volume & Issue no: Volume 6, Issue 2, March - April 2017
____________________________________________________________________________________________________
Title: |
DISTANCE k-DOMINATION PARAMETER OF SOME GRAPHS AND ITS REALISATION |
Author Name: |
B.Stephen John, C.T.Brigitha |
Abstract: |
ABSTRACT: A set D ⊆ V is called a distance k-dominating
set of G if each vertex v ∈V(G) −D is within distance k from
some vertex of D. The distance k-dominating set of the graph G
is denoted by Dk(G) and the distance k-domination number of G
is denoted by γk(G) is the minimum cardinality over all distance
k-dominating sets. In this paper we established a general
formulae for finding the k-dominating set of some graphs such
as (Cn)r, (Pn)r, (Cn × Pm) and rth power of the centipede graph
with ‘2n’ vertices.
Keywords: Dominating set, Domination number, Distance
k- dominating set, Tensor Product. |
Cite this article: |
B.Stephen John, C.T.Brigitha , "
DISTANCE k-DOMINATION PARAMETER OF SOME GRAPHS AND ITS REALISATION" , International Journal of Emerging Trends & Technology in Computer Science (IJETTCS) ,
Volume 6, Issue 2, March - April 2017 , pp.
136-138 , ISSN 2278-6856.
|
| Full Text [PDF] Back to Current Issue | |
NOTE: Authors note that paper cannot be withdrawn at any condition once it is accepted. The Team of IJETTCS advise you, do not submit same article to the multiple journals simultaneously. This may create a problem for you. Please wait for review report which will take maximum 01 to 02 week.