PENDANT EQUITABLE DOMINATION IN GRAPHS

Deepak B.P, Puttaswamy, S.Sivakumar, Nanjundaswamy M, Siddaraju

PENDANT EQUITABLE DOMINATION IN GRAPHS

Authors

Deepak B.P, Puttaswamy, S.Sivakumar, Nanjundaswamy M, Siddaraju

Keywords:

Equitable Domination number, Pendant Equitable Domination number, Pendant Equitable edge Domination number .

Abstract

Let G be any graph. An equitable dominating set S in G is called a Pendant equitable dominating set, if contains atleast one Pendant equitable vertex.

References

A. Alwardi and N.D. Soner, Equitable edge domination in graphs, Bulletin of International Mathematical Virtual Institute,3 (2013), 7-13.9

A.Anitha,S.Arumugam and Mustapha chellali, Equitable domination in graphs,Networks, 1998, 32(3): 199-206.

Downloads

Published

2024-08-12

How to Cite

Deepak B.P, Puttaswamy, S.Sivakumar, Nanjundaswamy M, Siddaraju. (2024). PENDANT EQUITABLE DOMINATION IN GRAPHS. Journal of Computational Analysis and Applications (JoCAAA), 33(08), 4283–4291. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/2794