International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 174 - Number 21 |
Year of Publication: 2021 |
Authors: M. Manjuri, B. Maheswari |
10.5120/ijca2021921114 |
M. Manjuri, B. Maheswari . Clique Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs. International Journal of Computer Applications. 174, 21 ( Feb 2021), 43-49. DOI=10.5120/ijca2021921114
The basic ideas of graph theory are introduced in the 18th century by the great mathematician Leonard Euler. Since then relatively in a short period, major developments of graph theory has occurred and inspired to a larger degree and it has become the source of interest to many researchers. To some extent this may be due to the ever growing importance of computer science and its connection with graph theory. Product of graphs are introduced in Graph Theory very recently and developing rapidly. In this paper, we consider direct product graphs of Cayley graphs with Arithmetic graphs and discuss Clique domination parameter of these graphs.