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
|
BOUNDS ON INVERSE DOMINATION IN SQUARES OF GRAPHS
M. H. Muddebihal, Srinivasa G
Abstract: Let be a minimum dominating set of a square graph . If ( ) - contains another dominating set of , then is called an inverse dominating set with respect to . The minimum cardinality of vertices in such a set is called an inverse domination number of and is denoted by ( ). In this paper, many bounds on ( ) were obtained in terms of elements of . Also its relationship with other domination parameters was obtained
Keywords: Square graph, dominating set, inverse dominating set, Inverse domination number.
DOI: https://doi.org/10.15623/ijret.2013.0210086
|
|