Edge Domination of an Involutory Addition Cayley Graph

Authors

  • E.Lavanya Department of Applied Mathematics, Sri Padmavati MahilaVisvavidyalayam, Tirupati, Andhra Pradesh, India
  • G.Keerthi Department of Applied Mathematics, Sri Padmavati MahilaVisvavidyalayam, Tirupati, Andhra Pradesh, India
  • Dr.M.Siva Parvathi Department of Applied Mathematics, Sri Padmavati MahilaVisvavidyalayam, Tirupati, Andhra Pradesh, India

Keywords:

Involutory addition cayley graphs, Edge dominating sets, Total edge dominating sets, Edge Domination number, Total edge domination number

Abstract

Graph theory is one of the most advanced branches of discrete mathematics with variety of applications to different branches of Science and Technology. For a positive integer , the involutory addition Cayley graph ,  is the graph whose vertex set is   and edge set , where  is the set of involutory elements of .By taking Involutory Addition Cayley Graphs  the author’s evaluated graph related Edge domination numbers and Total edge domination numbers. In this paper, Edge domination number, Total edge domination number of the Involutory addition cayley graphs  were discussed. 

Downloads

Published

2024-08-29

How to Cite

E.Lavanya, G.Keerthi, & Dr.M.Siva Parvathi. (2024). Edge Domination of an Involutory Addition Cayley Graph. Journal of Computational Analysis and Applications (JoCAAA), 33(2), 949–954. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1554

Issue

Vol. 33 No. 2 (2024): JOCAAA

Section

Articles

License

Creative Commons License

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

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.