Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: Special Issue 1, Pages: 1-4
V. Rajeswari1* and K. Thiagarajan2
1 Department of Mathematics, Mother Teresa Women’s University, Attuvampatti, Dindigul District, Kodaikanal – 624101, Tamil Nadu, India; [email protected]
2 Department of Mathematics, PSNA College of Engineering and Technology, Kothandaraman Nagar, Dindigul – 624001, Tamil Nadu, India; [email protected]
*Author for correspondence
Department of Mathematics
Email: [email protected]
Let G (V(G), E(G)) be a graph with n vertices is said to be Binary Equivalent Decimal Edge Graceful Labeling (BEDE) graph if the vertices are assigned distinct numbers from 0,1,2,…,(n-1) such that the labels induced on edges by the values obtained using binary coding of end vertices for each edge which are distinct. This paper deals with graphs such as cycle graph, path graph and middle graph of above said graphs are BEDE graceful labeling.
Keywords: BEDE, Binary, Graceful, IBEDE, Incident, Labeling, Middle Graph
Subscribe now for latest articles and news.