Chromatic number of some families of graphs

Abstract

A k-coloring of a graph is a vertex coloring of G that uses k-colors. The chromatic number χ(G) of a graph G is the minimum number of independent subsets that partition the vertex set of G. Any such minimum partition is called a chromatic partition of V(G). In this paper chromatic number of Sunlet and Bistar families of graphs are found

Subject Classification:

• 05CO7
• 05C12
• 05C15
• 05C76

Keywords:

• Chromatic number
• Sunlet graph
• Star graph