Open AccessBi-Magic Labelings of Some Connected and Disconnected Graphs
Author(s) -
Dr.S. Subbulakshmi,
R. Kokila
Publication year - 2019
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/1377/1/012014
Subject(s) - combinatorics , magic (telescope) , edge graceful labeling , mathematics , graph , magic square , graph labeling , enhanced data rates for gsm evolution , discrete mathematics , graph power , computer science , line graph , physics , artificial intelligence , quantum mechanics
Various graph labeling that generalize the idea of a magic square have been discussed. In particular, a magic labeling on a graph with v vertices and e edges will be defined as a one to one map taking the vertices and edges onto integers 1, 2,…, v+e with the property that the sum of the label on an edge and the labels of its end points is constant, independent of the choice of edge.