PELABELAN ANTIAJAIB JARAK PADA BEBERAPA KELAS GRAF TERKAIT GRAF HELM
Main Article Content
Abstract
Diberikan graf sederhana dan tidak berarah G=(V(G),E(G)) dengan order n dan fungsi bijektif f yang membawa setiap anggota V(G) ke himpunan {1,2,...,n}. Fungsi f disebut pelabelan jarak antiajaib jika bobot setiap titik di G mempunyai nilai yang berbeda. Selanjutnya, pada tulisan ini diperoleh hasil bahwa graf helm H_n, graf bunga F_n, graf bunga tertutup CF_n dan graf serupa bunga lF_n berturut-turut merupakan graf jarak antiajaib untuk n>= 3.
Article Details
Section
Combinatorics and Computational Mathematics
The copyright of the received article once accepted for publication shall be assigned to the journal as the publisher of the journal. The intended copyright includes the right to publish the article in various forms (including reprints). The journal maintains the publishing rights to the published articles.
References
[1] F. Harary, Graph theory. 2018.
[2] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. 1976.
[3] J. A. Gallian, œA dynamic survey of graph labeling, Electron. J. Comb., 2018.
[4] R. Simanjuntak and K. Wijaya, œOn Distance Antimagic Graphs, 2013, [Online]. Available: https://www.academia.edu/18847673/On_Distance_Antimagic_Graphs.
[5] A. K. Handa, A. Godinho, and T. Singh, œSome distance antimagic labeled graphs, 2016, doi: 10.1007/978-3-319-29221-2_16.
[6] A. K. Handa, A. Godinho, T. Singh, and S. Arumugam, œDistance antimagic labeling of join and corona of two graphs, AKCE Int. J. Graphs Comb., 2017, doi: 10.1016/j.akcej.2017.04.003.
[7] K. H. Rosen, Discrete Mathematics and Its Applications, Sixth. New York: McGraw.Hill International Edition, 2007.
[2] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. 1976.
[3] J. A. Gallian, œA dynamic survey of graph labeling, Electron. J. Comb., 2018.
[4] R. Simanjuntak and K. Wijaya, œOn Distance Antimagic Graphs, 2013, [Online]. Available: https://www.academia.edu/18847673/On_Distance_Antimagic_Graphs.
[5] A. K. Handa, A. Godinho, and T. Singh, œSome distance antimagic labeled graphs, 2016, doi: 10.1007/978-3-319-29221-2_16.
[6] A. K. Handa, A. Godinho, T. Singh, and S. Arumugam, œDistance antimagic labeling of join and corona of two graphs, AKCE Int. J. Graphs Comb., 2017, doi: 10.1016/j.akcej.2017.04.003.
[7] K. H. Rosen, Discrete Mathematics and Its Applications, Sixth. New York: McGraw.Hill International Edition, 2007.