Displaying similar documents to “Some properties of unitary Cayley graphs.”

Color Energy Of A Unitary Cayley Graph

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.

On the recursive sequence.

Camouzis, E., Devault, R., Papaschinopoulos, G. (2005)

Advances in Difference Equations [electronic only]

Similarity:

A fixed point theorem for non-self multi-maps in metric spaces

Bapurao Chandra Dhage (1999)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A fixed point theorem is proved for non-self multi-valued mappings in a metrically convex complete metric space satisfying a slightly stronger contraction condition than in Rhoades [3] and under a weaker boundary condition than in Itoh [2] and Rhoades [3].