OUTER CONNECTED EQUITABLE DOMINATING SETS IN A GRAPH

Print ISSN: 0972-7752 | Online ISSN: 2582-0850 | Total Downloads : 166

Abstract

Let $G$ be a simple graph with vertex set $V$ and edge set $E$. An equitable dominating set $D$ of $V(G)$ is called an outer connected equitable dominating set of G if $<V - D>$ is connected. A study of outer connected equitable dominating sets in a graph is initiated.

Keywords and Phrases

Equitable domination, outer connected domination.

A.M.S. subject classification

05C69.

.....

Download PDF 166 Click here to Subscribe now