A Strong Convex Atmost 2-Distance Dominating Sets In Graphs

Dr. D. S. T. Ramesh, Dr. A. Anto Kinsley, V. Lavanya

Let G be a connected graph of order p ≥ 2. We study about the convex and dominating sets of G. We define strong convex sets and strong convex atmost 2-distance dominating sets and we prove a theorem to develop new convex sets with domination number. Finally we present in this paper, various bounds for it and characterize the graphs, with bounds attained.