Supermagic graphs with many odd degrees

Dalibor Froncek; Jiangyi Qiu

doi:10.1007/978-3-030-25005-8_19

Supermagic graphs with many odd degrees

Dalibor Froncek, Jiangyi Qiu

Mathematics & Statistics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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ář 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.

Original language	English (US)
Title of host publication	Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings
Editors	Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
Publisher	Springer- Verlag
Pages	229-236
Number of pages	8
ISBN (Print)	9783030250041
DOIs	https://doi.org/10.1007/978-3-030-25005-8_19
State	Published - Jan 1 2019
Event	30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, Italy Duration: Jul 23 2019 → Jul 25 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11638 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	30th International Workshop on Combinatorial Algorithms, IWOCA 2019
Country	Italy
City	Pisa
Period	7/23/19 → 7/25/19

Keywords

Edge labeling
Magic-type labeling
Supermagic graphs

Access

10.1007/978-3-030-25005-8_19

Fingerprint Dive into the research topics of 'Supermagic graphs with many odd degrees'. Together they form a unique fingerprint.

Cite this

Froncek, D., & Qiu, J. (2019). Supermagic graphs with many odd degrees. In C. J. Colbourn, R. Grossi, & N. Pisanti (Eds.), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings (pp. 229-236). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11638 LNCS). Springer- Verlag. https://doi.org/10.1007/978-3-030-25005-8_19

Supermagic graphs with many odd degrees. / Froncek, Dalibor; Qiu, Jiangyi.

Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. ed. / Charles J. Colbourn; Roberto Grossi; Nadia Pisanti. Springer- Verlag, 2019. p. 229-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11638 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Froncek, D & Qiu, J 2019, Supermagic graphs with many odd degrees. in CJ Colbourn, R Grossi & N Pisanti (eds), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11638 LNCS, Springer- Verlag, pp. 229-236, 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, Pisa, Italy, 7/23/19. https://doi.org/10.1007/978-3-030-25005-8_19

Froncek D, Qiu J. Supermagic graphs with many odd degrees. In Colbourn CJ, Grossi R, Pisanti N, editors, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. Springer- Verlag. 2019. p. 229-236. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-25005-8_19

Froncek, Dalibor ; Qiu, Jiangyi. / Supermagic graphs with many odd degrees. Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. editor / Charles J. Colbourn ; Roberto Grossi ; Nadia Pisanti. Springer- Verlag, 2019. pp. 229-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

}

TY - GEN

T1 - Supermagic graphs with many odd degrees

AU - Froncek, Dalibor

AU - Qiu, Jiangyi

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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ář 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.

AB - 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ář 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.

KW - Edge labeling

KW - Magic-type labeling

KW - Supermagic graphs

UR - http://www.scopus.com/inward/record.url?scp=85069719334&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85069719334&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-25005-8_19

DO - 10.1007/978-3-030-25005-8_19

M3 - Conference contribution

AN - SCOPUS:85069719334

SN - 9783030250041

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 229

EP - 236

BT - Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings

A2 - Colbourn, Charles J.

A2 - Grossi, Roberto

A2 - Pisanti, Nadia

PB - Springer- Verlag

T2 - 30th International Workshop on Combinatorial Algorithms, IWOCA 2019

Y2 - 23 July 2019 through 25 July 2019

ER -