Iranian Journal of Mathematical Sciences and Informatics
مجله علوم ریاضی و انفورماتیک ایرانیان
IJMSI
Basic Sciences
http://ijmsi.ir
1
admin
1735-4463
2008-9473
8
7
14
8888
13
en
jalali
1397
7
1
gregorian
2018
10
1
13
2
online
1
fulltext
en
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
عمومى
General
پژوهشي
Research paper
<p>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.</p>
Complete bipartite graphs, Supermagic graphs, Degree-magic graphs, Balanced degree-magic graphs
1
13
http://ijmsi.ir/browse.php?a_code=A-10-1779-1&slc_lang=en&sid=1
Ph.
Inpoonjai
phaisatcha_in@outlook.com
`10031947532846005006`

10031947532846005006
Yes
Department of Mathematics, Faculty of Science, King Mongkut's University of Technology Thonburi
T.
Jiarasuksakun
thiradet.jia@mail.kmutt.ac.th
`10031947532846005007`

10031947532846005007
No
Department of Mathematics, Faculty of Science, King Mongkut's University of Technology Thonburi