On C-m-Supermagicness of Book-Snake Graphs
MetadataShow full item record
Graph labelling or valuation is a function that maps graph elements (vertices or edges) to numbers, usually positive integers . In this work, we analyze the supermagicness of book-snake graphs. At first, we show that triangular book-snake graph S(3, n, s) admits a C-3-supermagic labelling. Then by using these labellings and supermagicness of subdivision given in , C-m-supermagicness of polygonal book-snake graph S(m, n, s) is given since S(m, n, s) can be taught as a subdivision of S (3, n, s).