Main Article Content


Let Γ be a finite group and let S ⊆ Γ be a subset. The Cayley graph, denoted byCay(Γ, S) has vertex set Γ and two distinct vertices x, y ∈ Γ are joined by a directed edge fromx to y if and only if there exists s ∈ S such that x = sy. In this manuscript, we characterize the generating setsS for which Cay(Γ, S) is isomorphic to somealgebraic graphs, namely, unit graphs, co-unit graphs, total graph and co-total graphs.

Article Details

How to Cite
Pranjali, P., Kumar, A., & Yadav, T. (2021). Cayley Graphs Versus Algebraic Graphs. Journal of the Indonesian Mathematical Society, 27(2), 130–136.


  1. Beny, G. A. and Rakhmonov, Z., Number of Cayley graph of finite group Zn that is undirected, Proceedings of third Conference and Workshop on Group theory, University of Tehran, 9-10 March (2011), 8-11.
  2. Cayley, A., Desiderata and suggestions; The Theory of groups: graphical representation, American Journal of Mathematics, 1(2 (1878), 174–176.
  3. Harary, F., Graph Theory, Addison-Wesley Publ. Comp. Reading. MA, 1969.
  4. Jacobson, N., Lectures in Abstract Algebra, East-West Press P. Ltd., New Delhi, 1951.
  5. Maimani, H. R., Pournaki, M. R., Tehranian, A. and Yassemi, S. Graphs Attached to Rings
  6. Revisited, Arabian Journal for Science and Engineering (2011), 36:997