On the energy of unitary Cayley graphs.
Ramaswamy, H.N., Veena, C.R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ramaswamy, H.N., Veena, C.R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Droll, Andrew (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bóna, Miklós (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Labelle, Gilbert, Leroux, Pierre, Ducharme, Martin G. (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Chandrashekar Adiga, E. Sampathkumar, M.A. Sriraj (2014)
Discussiones Mathematicae Graph Theory
Similarity:
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.
Bašić, Milan, Ilić, Aleksandar (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Li, Dongsheng, Li, Pingping, Li, Xianyi (2008)
Advances in Difference Equations [electronic only]
Similarity:
Elabbasy, E.M., El-Metwally, H., Elsayed, E.M. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Sidi, Avram (2008)
Applied Mathematics E-Notes [electronic only]
Similarity:
Camouzis, E., Devault, R., Papaschinopoulos, G. (2005)
Advances in Difference Equations [electronic only]
Similarity:
Aval, Jean-Christophe, Duchon, Philippe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: