Minimum Covering Gutman Energy of Unitary Cayley Graphs
Roshan Sara Philipose1, P.B. Sarasija2

1Roshan Sara Philipose, Department of Mathematics, Noorul Islam Centre for Education, Kumaracoil (Tamil Nadu), India.
2P.B. Sarasija, Department of Mathematics, Noorul Islam Centre for Education, Kumaracoil (Tamil Nadu), India.
Manuscript received on 19 June 2019 | Revised Manuscript received on 11 July 2019 | Manuscript Published on 17 July 2019 | PP: 1079-1081 | Volume-8 Issue-1C2 May 2019 | Retrieval Number: A11870581C219/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: In 2012, Chandrashekar Adiga introduced the notion of a novel kind of graph energy called minimum covering energy, depending on the underlying graph aswell as its particular minimum covering set C. The concept of minimum covering Gutman energy was put forward in [4]. In this paper, we bring the notion of minimum covering Gutman energy of unitary Cayley graphs, that can be defined as the absolute sum of minimum covering Gutman eigenvalues obtained from minimum covering Gutman matrix of Unitary Cayley graphs, denoted by ACg(Xn).
Keywords: Minimum Covering Gutman Matrix, Minimum Covering Gutman Energy, Unitary Cayley Graphs. 2010 AMS Classification— 05C50, 05C78.
Scope of the Article: Cryptography and Applied Mathematics