Efficiently Dominating ($\gamma$, ed)-Number of Graphs


Abstract views: 20 / PDF downloads: 26

Authors

  • A. Mahalakshmi Department of Mathematics, Sri Sarada College For Women, Tirunelveli, Tamil Nadu, India
  • K. Palani Department of Mathematics, A.P.C.Mahalaxmi College For Women, Thoothukudi, Tamil Nadu, India
  • S. Somasundaram Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli, Tamil Nadu, India

Keywords:

Edge detour domination, efficient domination, efficient($\gamma$,ed)-number of graphs

Abstract

In this paper, we introduce the new concept connected and independent edge detour domination number of a graph and obtain the connected and independent edge detour domination number for some well known graphs.

Downloads

Published

15-01-2017

How to Cite

A. Mahalakshmi, K. Palani, & S. Somasundaram. (2017). Efficiently Dominating ($\gamma$, ed)-Number of Graphs. International Journal of Mathematics And Its Applications, 5(1 - A), 59–64. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/752

Issue

Vol. 5 No. 1 - A (2017)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.