CALL FOR PAPERS :
DEC-2018
| Submission Last Date |
:
|
30-Dec-2018
|
| Acceptance Notification
|
:
|
in 15 days
|
| Publication Date
|
:
|
in 5 days
|
FOR AUTHORS
FOR REVIEWERS
IJRET® PUBLICATIONS
DOWNLOADS
CONTACT US
NEWS & UPDATES
|
RESTRAINED LICT DOMINATION IN GRAPHS
M.H. Muddebihal, Kalshetti Swati.M
Abstract: A set D V n G r ? ? ? ? ? ? ? is a restrained dominating set of n G? ? , where every vertex in Dr V[ n(G )] ? is adjacent to a vertex in Dr as well as another vertex in V[ n(G )] ? Dr . The restrained domination number of lict graph n G? ?, denoted by ? rn ?G? , is the minimum cardinality of a restrained dominating set of n G? ? . In this paper, we study its exact values for some standard graphs we obtained. Also its relation with other parameters is investigated.
Keywords: Lict Graph / Line Graph / Restrained domination / Dominating set / Edge domination
DOI: https://doi.org/10.15623/ijret.2014.0305145
|
|