@ARTICLE{Inpoonjai,
author = {Inpoonjai, Ph. and Jiarasuksakun, T. and },
title = {Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations},
volume = {13},
number = {2},
abstract ={A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal to (1+|E(G)|)deg(v)/2. Degree-magic graphs extend supermagic regular graphs. In this paper we find the necessary and sufficient conditions for the existence of balanced degree-magic labelings of graphs obtained by taking the join, composition, Cartesian product, tensor product and strong product of complete bipartite graphs. },
URL = {http://ijmsi.ir/article-1-823-en.html},
eprint = {http://ijmsi.ir/article-1-823-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {},
year = {2018}
}