T R A C K       P A P E R
ISSN:2394-3661 | Crossref DOI | SJIF: 5.138 | PIF: 3.854

International Journal of Engineering and Applied Sciences

(An ISO 9001:2008 Certified Online and Print Journal)

A Strong Convex Atmost 2-Distance Dominating Sets In Graphs

( Volume 3 Issue 4,April 2016 ) OPEN ACCESS
Author(s):

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

Abstract:

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.

Paper Statistics:

Total View : 856 | Downloads : 847 | Page No: 64-66 |

Cite this Article:
Click here to get all Styles of Citation using DOI of the article.