Coloring sums of extensions of certain graphs

Abstract: Recall that the minimum number of colors that allow a proper coloring of graph

G

is called the chromatic number of

G

and denoted by

c h i (G) .

In this paper the concepts of

c h i

'-chromatic sum and

c h i^{+}

-chromatic sum are introduced. The extended graph

G^{x}

of a graph

G

was recently introduced for certain regular graphs. We further the concepts of

c h i

'-chromatic sum and

c h i^{+}

-chromatic sum to extended paths and cycles. The paper concludes with emph{patterned structured} graphs.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Coloring sums of extensions of certain graphs