Color energy of a unitary Cayley graph

Adiga, Chandrashekar and Sampath Kumar, E. and Sriraj, M. A. (2014) Color energy of a unitary Cayley graph. Discussiones Mathematicae - Graph Theory, 34 (4). pp. 707-721. ISSN 2083-5892

[img] Text (Full Text)
Math_2014_Adiga_Sampathkumar.pdf - Published Version
Restricted to Registered users only

Download (154kB) | Request a copy
Official URL:


Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph Ec(G) and computed the color energy of few families of graphs with χ(G) colors. In this paper we derive explicit formulas for the color energies of the unitary Cayley graph Xn, the complement of the colored unitary Cayley graph (Xn)c and some gcd-graphs.

Item Type: Article
Subjects: E Mathematical Science > Mathematics
Divisions: Department of > Mathematics
Depositing User: Arshiya Kousar Library Assistant
Date Deposited: 14 Jun 2019 06:01
Last Modified: 08 Jul 2022 10:39

Actions (login required)

View Item View Item