Advances and Applications in Discrete Mathematics
Volume 17, Issue 2, Pages 113 - 124
(April 2016) http://dx.doi.org/10.17654/AADMApr2016_113_124 |
|
-IRREDUNDANT SETS IN GRAPHS
G. Jothilakshmi, A. P. Pushpalatha, S. Suganthi and V. Swaminathan
|
Abstract: Let be a connected, simple and undirected graph. A subset D of V is -irredundant if for every x in D either or there exists such that and maximum cardinality of a maximal -irredundant set of G are, respectively, called the -irredundance number and upper -irredundance number of G and are denoted by and respectively. In this paper, -irredundant sets in graph are introduced and studied. The aim of this paper is to study this new parameter. |
Keywords and phrases: (k, r)-irredundant sets, (k, r)-dominating sets. |
|
Number of Downloads: 329 | Number of Views: 819 |
|