• ON CHROMATIC NUMBER CALCULATIONS OF GENERATED GRAPHS

Abstract

Let a graph will refer to vertex set , with , and edge set with in any chromatic partition of , The chromatic number, ,of a graph  is the minimum number of independent subsets that partition the vertex set of  In any chromatic partition of ,the parts of the partition constitute the color classes. This allows an equivalent way of defining the chromatic number. In this paper we investigate the chromatic number calculations to find upper and lower bounds to provide a direct approach to the calculations of chromatic number of a given graph and chromatic numbers of generated graphs