Study on Binary Equivalent Decimal Edge Graceful Labeling

V  Rajeswari   and K  Thiagarajan

doi:10.17485/ijst/2016/v9iS1/108356

Article

Study on Binary Equivalent Decimal Edge Graceful Labeling

VIEWS 1061
PDF 256

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2016/v9iS1/108356

Year: 2016, Volume: 9, Issue: Special Issue 1, Pages: 1-4

Original Article

Study on Binary Equivalent Decimal Edge Graceful Labeling

V. Rajeswari^1* and K. Thiagarajan²

¹ Department of Mathematics, Mother Teresa Women’s University, Attuvampatti, Dindigul District, Kodaikanal – 624101, Tamil Nadu, India; [email protected]
² Department of Mathematics, PSNA College of Engineering and Technology, Kothandaraman Nagar, Dindigul – 624001, Tamil Nadu, India; [email protected]
*Author for correspondence
Rajeswari
Department of Mathematics
Email: [email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

Abstract

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