PUZZLING AND APUZZLING IN GRAPH THEORY

Abstract

 The notation G represents a graph with partition P among chromatic number with vertex coloring of graph using the numbers 1,2,…x, such that the addition of the numbers assigns a value to the partition segment are all same is puzzling and the addition of the numbers assigns a value to the partition  segment are all different is apuzzling.  In this article, the puzzling and apuzzling defined for various graphs and analyzed some properties in complete graph, bipartite graph, butterfly graph, friendship graph and Peterson graph.