A Short Note on Distance2-domination for some family of graphs
Main Article Content
Abstract
The aim of this paper is to study the importance of graph theoretical concepts and the applications of distance - 2domination of some graphs. A set D is a distance – 2 dominating set iff or every vertex u∈V−D,d (u,D)≤2andisdenotedby .Also we discuss about many bounds and exact values for some standard graphs.
Article Details
Issue
Section
Articles