@inproceedings{e22f65e0c8e5473ebc1e0e4540c0d79d,

title = "Supermagic graphs with many odd degrees",

abstract = "A graph G = (V,E) is called supermagic if there exists a bijection f : E → {1, 2, … , |E|} such that the weight of every vertex x ∈ V defined as the sum of labels f(xy) of all edges xy incident with x is equal to the same number m, called the supermagic constant. Recently, Kov{\'a}{\v r} et al. affirmatively answered a question by Madaras about existence of supermagic graphs with arbitrarily many different degrees. Their construction provided graphs with all degrees even. Therefore, they asked if there exists a supermagic graph with d different odd degrees for any positive integer d. We answer this question in the affirmative by providing a construction based on the use of 3-dimensional magic rectangles.",

keywords = "Edge labeling, Magic-type labeling, Supermagic graphs",

author = "Dalibor Froncek and Jiangyi Qiu",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-25005-8_19",

language = "English (US)",

isbn = "9783030250041",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer- Verlag",

pages = "229--236",

editor = "Colbourn, {Charles J.} and Roberto Grossi and Nadia Pisanti",

booktitle = "Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings",

note = "30th International Workshop on Combinatorial Algorithms, IWOCA 2019 ; Conference date: 23-07-2019 Through 25-07-2019",

}