Wyniki wyszukiwania

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.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

3-consecutive c-colorings of graphs

88%

Bujtás C., Sampathkumar E., Tuza Z., Subramanya M., Dominic C.

Discussiones Mathematicae Graph Theory

2010

tom 30

nr 3

393-405

A 3-consecutive C-coloring of a graph G = (V,E) is a mapping φ:V → ℕ such that every path on three vertices has at most two colors. We prove general estimates on the maximum number $(χ̅)_{3CC}(G)$ of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with $(χ̅)_{3CC}(G) ≥ k$ for k = 3 and k = 4.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Sampathkumar E.

1 Adiga C.

1 Bujtás C.

1 Dominic C.

1 Sriraj M. A.

1 Subramanya M.

1 Tuza Z.

1 2014

1 2010

Wyniki wyszukiwania

Color Energy Of A Unitary Cayley Graph

3-consecutive c-colorings of graphs