Transversal Eccentric Domination in Graphs

Riyaz Ur Rehman A, A Mohamed Ismayil


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.

Full Text:



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.



  • There are currently no refbacks.

Copyright (c) 2023 Riyaz Ur Rehman A, A Mohamed Ismayil

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

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.