OUTER CONNECTED EQUITABLE DOMINATING SETS IN A GRAPH

P. Nataraj; A. Wilson Baskar; V. Swaminathan

P. Nataraj The Madura College, Madurai, Tamil Nadu - 625011, INDIA

A. Wilson Baskar Ramanujan Research Center in Mathematics, Saraswathi Narayanan College, Madurai, Tamil Nadu - 625022, INDIA

V. Swaminathan Ramanujan Research Center in Mathematics, Saraswathi Narayanan College, Madurai, Tamil Nadu - 625022, INDIA

Volume 17, Issue 2 Pages 215-224 August 30, 2021 305 downloads

Article overview

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 dominationouter connected domination.

AMS Subject Classification

05C69.

Reference information

How to Cite

P. Nataraj, A. Wilson Baskar, V. Swaminathan (2021). OUTER CONNECTED EQUITABLE DOMINATING SETS IN A GRAPH. South East Asian Journal of Mathematics and Mathematical Sciences, 17(2), 215-224.

Back to this issue