On C_m-supermagic labellings of some graph

Graph labeling or valuation is a function that maps graf elements (vertexes or edges) to numbers, usually positive integers. The labeling of the set of vertexes is called vertex-labeling, and the labeling of the edges is called edge-labeling. If the set of definitions consists of both vertexes and edges, these labelings are called total-labeling. There are many different types of labeling in the literature. Some of them are: Harmonious, cordial, graceful, antimagic and H-(super) magic. The purpose of this thesis is to introduce the n-leaf, s-part m-polygonal book-snake graph, and show that this graph has C_m-supermagic labeling, where C_m is a circular graph consisting of m edges and m vertexes.