Transversal Eccentric Domination in Graphs

Authors

  • Riyaz Ur Rehman A
  • A Mohamed Ismayil

DOI:

https://doi.org/10.23755/rm.v46i0.1043

Abstract

We introduce transversal eccentric dominating(TED) set. An eccentric dominating set $D$ is called a TED-set if it intersects with every minimum eccentric dominating set $D'$. We find the TED-number $\gamma_{ted}$ of some standard graphs. Results are stated and proved.

References

A. Alwardi, S. Nayaka, et al. Transversal domination in graphs. Gulf Journal of Mathematics, 6(2), 2018.

E. J. Cockayne and S. T. Hedetniemi. Towards a theory of domination in graphs. Networks, 7(3):247–261, 1977.

F. Harary. Graph theory. Narosa Publishing House, New Delhi, 2001.

A. M. Ismayil and A. R. U. Rehman. Accurate eccentric domination in graphs.Our Heritage, 68(4)(1, 2020):209–216, 2020a.

A. M. Ismayil and A. R. U. Rehman. Equal eccentric domination in graphs.Malaya Journal of Matematik (MJM), 8(1, 2020):159–162, 2020b.

T. Janakiraman, M. Bhanumathi, and S. Muthammai. Eccentric domination in graphs. International Journal of Engineering Science, Computing and Bio-Technology, 1(2):1–16, 2010.

O. Ore. Theory of graphs. Amer. Math. Soc. Colloq. Publ., 38 (Amer. Math. Soc., Providence, RI), 38, 1996.

Downloads

Published

2023-03-20