On the existence of degree-magic labellings of the n-fold self-union of complete bipartite graphs

• Опубліковано в: : Algebra and Discrete Mathematics
• Дата: 2019
• Автори: Inpoonjai, P., Jiarasuksakun, T.
• Формат: Стаття
• Мова: Англійська
• Опубліковано: Інститут прикладної математики і механіки НАН України 2019
• Онлайн доступ: https://nasplib.isofts.kiev.ua/handle/123456789/188480
• Назва журналу: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Цитувати: On the existence of degree-magic labellings of the n-fold self-union of complete bipartite graphs / P. Inpoonjai, T. Jiarasuksakun // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 1. — С. 107–122. — Бібліогр.: 15 назв. — англ.

Magic rectangles are a classical generalization of the well-known magic squares, and they are related to graphs. A graph G is called degree-magic if there exists a labelling 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...