The Chromatic Number of Some Graphs

Abstract

Let G be a graph. Then G is called Colouring Vertices if we assign a color to each vertex then the adjacent vertices  will have different colors and the Colouring Vertices is called  k– Colorable Graph. Moreover, if k is the smallest number that makes  G a k – Colorable Graph, then we call the graph G to have k  as a Chromatic Number and is represented by the symbol χ( G) = k.        

          The objective of this work is to study the Chromatic Number of Cycle Book Graph, Fan Graph, n-Prism Graph, Line Graph of Cycle Book Graph, Tadpole Graph and Lollipop Graph.