@article{et. al_2020, title={PUZZLING AND APUZZLING IN GRAPH THEORY}, volume={29}, url={http://sersc.org/journals/index.php/IJAST/article/view/3469}, abstractNote={<p><em>&nbsp;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&nbsp; segment are all different is apuzzling.&nbsp; 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.</em></p&gt;}, number={2}, journal={International Journal of Advanced Science and Technology}, author={et. al, Buvaneswari R}, year={2020}, month={Jan.}, pages={2007 - 2011} }