Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: color eigenvalues

Sortuj według:

Ogranicz wyniki do:

Color Energy Of A Unitary Cayley Graph

100%

Adiga C., Sampathkumar E., Sriraj M. A.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 4

707-721

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Adiga C.

1 Sampathkumar E.

1 Sriraj M. A.

1 2014

Wyniki wyszukiwania

Color Energy Of A Unitary Cayley Graph