دوره 13، شماره 2 - ( 7-1397 )                   جلد 13 شماره 2 صفحات 1-13 | برگشت به فهرست نسخه ها

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Inpoonjai P, Jiarasuksakun T. Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations. IJMSI. 2018; 13 (2) :1-13
URL: http://ijmsi.ir/article-1-823-fa.html
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations. مجله علوم ریاضی و انفورماتیک ایرانیان. 1397; 13 (2) :1-13

URL: http://ijmsi.ir/article-1-823-fa.html


چکیده:  

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.

نوع مطالعه: پژوهشي | موضوع مقاله: عمومى

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA code

کلیه حقوق این وب سایت متعلق به نشریه علوم ریاضی و انفورماتیک می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2018 All Rights Reserved | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb