Abstract
Number Theory is one of the oldest branches of mathematics, which inherited rich contributions from almost all greatest mathematicians, ancient and modern. Nathanson [1] was the pioneer in introducing the concepts of Number Theory, particularly, the „Theory of Congruences‟ in Graph Theory, and paved the way for the emergence of a new class of graphs, namely “Arithmetic Graphs”. Inspired by the interplay between Number Theory and Graph Theory several researchers in recent times are carrying out extensive studies on various Arithmetic graphs in which adjacency between vertices is defined through various arithmetic functions. Cayley Graphs are another class of graphs associated with elements of a group. If this group is associated with some Arithmetic function then the Cayley graph becomes an Arithmetic graph and in this paper we study the Efficient domination, Clique domination parameters of Arithmetic Vn Graphs.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
