برچسب‌گذاری جادویی کامل رأسی گراف کامل دوبخشی

نوع مقاله : مقاله پژوهشی

نویسندگان

1 عضو هیئت‌علمی دانشگاه قم

2 فارغ‌التحصیل کارشناسی ارشد دانشگاه صنعتی شریف

چکیده

در این مقاله، ابتدا مفهوم گراف‌های جادویی را بیان کرده و سپس برچسب‌گذاری جادویی کامل رأسی یک گراف را توصیف می‌کنیم و شرایطی که باید برقرار باشند تا این برچسب‌گذاری را بتوان در گراف‌های کامل دوبخشی انجام داد مطرح کرده و اثبات آن‌ها را ذکر می‌کنیم. 

کلیدواژه‌ها

موضوعات


عنوان مقاله [English]

Complete Magic Labeling of Vertices of the Complete Bipartite Graphs

نویسندگان [English]

  • Gholam Hassan Shirdel 1
  • Zahra Sadat Emamy 2
1 Department of Mathematics and Computer Sciences, Faculty of Science, University of Qom, Qom, Iran
2 Master of Science from Department of Mathematics, Sharif University, Tehran, Iran
چکیده [English]

In this paper, first, we explain the concept of magic graphs, and then we describe the complete magic labeling of the vertices of a graph. Also, some conditions that must be met so that this labeling can be done in complete bipartite graphs are stated.

کلیدواژه‌ها [English]

  • Magic Graphs
  • Complete Magic Labeling of Vertices
  • Complete Graph
  • Complete Bipartite Graph
[1] Baca, M., & Hollander, I. (1990). Prime-magic labeling of kn;n. Journal of Franklin Inst, 327, 923–926. DOI: https://doi.org/10.1016/0016-0032(90)90069-U.
[2] Freyberg, B. (2023). Face-magic labelings of some gridded graphs.
Communications in Combinatorics and Optimization, 8, 595–601. DOI: https://doi.org/10.22049/CCO.2023.28208.1478.
[3] Inpoonjai, Ph.,
& Jiarasuksakun, T. (2018). Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations. Iranian Journal of Mathematical Sciences and Informatics, 13, 1–13. DOI: https://doi.org/10.7508/ijmsi.2018.13.001.
[4] MacDougall, J.A., Gray, I.D., Simpson, R.J.,
& Wallis, W.D. (2003). Vertex-Magic Total Labelings of Complete Bipartite Graphs. Ars Combinatoria, 69, 1–12.
[5] Marimuthu, G.,
& Balakrishnan, M. (2012). E-super vertex magic labelings of graphs. Discrete Appl. Math, 160, 1766–1774. DOI: https://doi.org/10.1016/j.dam.2012.03.016.
[6] Marimuthu, G.,
& Stalin K. (2016). Mixed cycle-E-super magic decomposition of complete bipartite graphs. Journal of Algorithms and Computation, 47, 37–52.
[7] Mejia, M. (2022). Vertex-Magic Total Labeling on G-sun Graphs.
In BSU Honors Program Theses and Projects. Item 554.
[8] Rikio, I.
& et al. (2024). Recent studies on the super edge-magic deficiency of graphs. Theory and Applications of Graphs, Vol. 11, Iss. 1, Article 1. DOI: https://doi.org/10.20429/tag.2024.110101.
[9] Sedl
a´cˇek, J. (1976). On magic graphs. Mathematica Slovaca, 26, 329–335.
[10] Stewart, B.M. (1966). Magic graphs.
Canadian Journal of Mathematics, 18, 1031–1059. DOI: https://doi.org/10.4153/CJM-1966-104-7.
[11] West, D.B. (2001). Introduction to Graph Theory.
Prentice-Hall.
[12] Zeen El Deen, M.R.,
& et al. (2024). Super Edge Magic Harmonious Labeling for Certain Graphs. Frontiers in Scientific Research and Technology, 8, 47–56. DOI: https://doi.org/10.21608/FSRT.2023.248393.1114.