Open AccessElegant labeling of some graphs
Author(s) -
R. M. Prihandini,
Dafik Dafik,
Ika Hesti Agustin,
Ridho Alfarisi,
Robiatul Adawiyah
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1538/1/012018
Subject(s) - combinatorics , edge graceful labeling , injective function , vertex (graph theory) , graph labeling , mathematics , graph , set (abstract data type) , enhanced data rates for gsm evolution , discrete mathematics , computer science , graph power , line graph , artificial intelligence , programming language
An elegant labeling on graph G with α vertices and β edges is an injective (one-to-one) mapping from the set of vertices V ( G ) to the set of non-negative integers {0,1, 2, 3, …, β } in such a way that the set of values on the edges obtained by the sums mod β + 1 of the labels of their end vertices is {1, 2, 3,4,…, β }. The purpose of this research is to prove that several graphs, namely diamond ladder admit an elegant labeling. We also look for relationships between Edge Antimagic Vertex Labeling and Elegant Labeling.