Supermagic Triple Graphs

Article Sidebar

PDF
DOI: https://doi.org/10.28924/2291-8639-24-2026-35
Published: Feb 19, 2026
Cite as:
Phaisatcha Inpoonjai, Supermagic Triple Graphs, Int. J. Anal. Appl., 24 (2026), 35.

Main Article Content

Phaisatcha Inpoonjai

Abstract

A graph is called supermagic if it admits a labelling of 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. In this paper we apply some effective methods to construct supermagic labellings of some triple graphs. Also, the application of supermagic graphs to balanced logistics network design in support of the United Nations Sustainable Development Goals is presented.

Article Details

References

  1. J Sedláček, Problem 27, in: Theory of Graphs and Its Applications, pp. 163–164, 1964.
  2. B.M. Stewart, Magic Graphs, Can. J. Math. 18 (1966), 1031–1059. https://doi.org/10.4153/cjm-1966-104-7.
  3. J. Ivančo, A. Semaničová, Some Constructions of Supermagic Graphs Using Antimagic Graphs, SUT J. Math. 42 (2006), 177–186. https://doi.org/10.55937/sut/1262445107.
  4. J. Ivančo, A Construction of Supermagic Graphs, AKCE J. Graphs. Combin. 310 (2009), 91–102.
  5. J. Ivančo, Supermagic Generalized Double Graphs, Discuss. Math. Graph Theory 36 (2016), 211–225. https://doi.org/10.7151/dmgt.1849.
  6. J.A. Gallian, A Dynamic Survey of Graph Labeling, Electron. J. Combin. 2022 (2022), #DS6.
  7. L. Bezegová, J. Ivančo, An Extension of Regular Supermagic Graphs, Discret. Math. 310 (2010), 3571–3578. https://doi.org/10.1016/j.disc.2010.09.005.
  8. L. Bezegová, J. Ivančo, A Characterization of Complete Tripartite Degree-Magic Graphs, Discuss. Math. Graph Theory 32 (2012), 243–253. https://doi.org/10.7151/dmgt.1608.
  9. P. Inpoonjai, Degree-Magic Labelings on the Join and Composition of Complete Tripartite Graphs, Commun. Math. Appl. 10 (2019), 391–402. https://doi.org/10.26713/cma.v10i3.1157.
  10. P. Inpoonjai, T. Jiarasuksakun, On the Existence of Degree-Magic Labellings of the $n$-Fold Self-Union of Complete Bipartite Graphs, Algebr. Discret. Math. 28 (2019), 107–122.
  11. P. Inpoonjai, Degree-Magic Labellings on Graphs Generalizing the Double Graph of the Disjoint Union of a Graph, Commun. Math. Appl. 12 (2021), 569–580.
  12. L. Bezegová, Balanced Degree-Magic Complements of Bipartite Graphs, Discret. Math. 313 (2013), 1918–1923. https://doi.org/10.1016/j.disc.2013.05.002.
  13. P. Inpoonjai, T. Jiarasuksakun, Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations, Iran. J. Math. Sci. Inform. 13 (2018), 1–13.
  14. P. Inpoonjai, A Construction of Balanced Degree-Magic Graphs, J. Math. Comput. Sci. 11 (2021), 8197–8210. https://doi.org/10.28919/jmcs/6779.