L. E. Polytechnic Ahmedabad,Gujarat (INDIA)E-mail: firstname.lastname@example.org
Kailas K. Kanani
Department of Mathematics,Government Engineering College,Rajkot, Gujarat (INDIA)E-mail: email@example.com
In this chapter, we investigate antimagic labeling in the context of some standard graph operations. We prove that splitting graph of star graph K1,n and splitting graph of bistar Bm,n are antimagic. We also prove that degree splitting graph of Bn,n and restricted square graph are antimagic.
Graph labeling is an assignment of numbers to the vertices or edges or both subject to certain condition(s). If the domain of function is a set of vertices ...