Degree-Magic Labellings on Graphs Generalizing the Double Graph of the Disjoint Union of a Graph

Authors

  • Phaisatcha Inpoonjai Faculty of Science and Agricultural Technology, Rajamangala University of Technology Lanna Chiang Rai, Chiang Rai

DOI:

https://doi.org/10.26713/cma.v12i3.1558

Keywords:

Double graphs, Supermagic graphs, Degree-magic graphs

Abstract

A graph G is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. A graph G is called degree-magic if it admits 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 to (1+|E(G)|)deg⁡(v)/2. In this paper, some constructions of degree-magic labellings of some graphs obtained by generalizing the double graph of the disjoint union of a graph are presented. As a result, some supermagic graphs are obtained.

Downloads

References

L'. Bezegová, Balanced degree-magic complements of bipartite graphs, Discrete Mathematics 313 (2013), 1918 – 1923, DOI: 10.1016/j.disc.2013.05.002.

L'. Bezegová and J. Ivanco, An extension of regular supermagic graphs, Discrete Mathematics 310 (2010), 3571 – 3578, DOI: 10.1016/j.disc.2010.09.005.

L'. Bezegová and J. Ivanco, On conservative and supermagic graphs, Discrete Mathematics 311 (2011), 2428 – 2436, DOI: 10.1016/j.disc.2011.07.014.

L'. Bezegová and J. Ivanco, A characterization of complete tripartite degree-magic graphs, Discussiones Mathematicae Graph Theory 32 (2012), 243 – 253, DOI: 10.7151/dmgt.1608.

J. A. Gallian, A dynamic survey of graph labelling, The Electronic Journal of Combinatorics 16 (2009), #DS6, URL: https://www.combinatorics.org/files/Surveys/ds6/ds6v12-2009.pdf.

P. Inpoonjai, Degree-magic labellings on the join and composition of complete tripartite graphs, Communications in Mathematics and Applications 10 (2019), 391 – 402, DOI: 10.26713/cma.v10i3.1157.

P. Inpoonjai and T. Jiarasuksakun, On the existence of degree-magic labellings of the n-fold self-union of complete bipartite graphs, Algebra and Discrete Mathematics 28 (2019), 107 – 122, URL: http://admjournal.luguniv.edu.ua/index.php/adm/article/view/374/pdf.

J. Ivanco, Supermagic generalized double graphs, Discussiones Mathematicae 36 (2016), 211 – 225, DOI: 10.7151/dmgt.1849.

J. Sedlácek, Theory of Graphs and its Applications, in: Problem 27: The Proceedings of Symposium, Smolenice, Praha (1963), 163 – 164, URL: https://searchworks.stanford.edu/view/1365109.

B. M. Stewart, Magic graphs, Canadian Journal of Mathematics 18 (1966), 1031 – 1059, DOI: 10.4153/CJM-1966-104-7.

Downloads

Published

30-09-2021
CITATION

How to Cite

Inpoonjai, P. (2021). Degree-Magic Labellings on Graphs Generalizing the Double Graph of the Disjoint Union of a Graph. Communications in Mathematics and Applications, 12(3), 569–580. https://doi.org/10.26713/cma.v12i3.1558

Issue

Vol. 12 No. 3 (2021)

Section

Research Article

License

Creative Commons Licence 4.0 by  

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.