Bilangan Kromatik-Total Hasil Operasi SHACKLE pada Graf Lintasan
Sari
Teks Lengkap:
PDFReferensi
Behzad, M. (1965). Graphs and their chromatic numbers. Doctoral dissertation, Michigan State University.
Bondy, J. A., & Murty, U. S. R. (2008). Graph Theory with Applications. (S.Axler&K.A.Ribet;Eds).Springer
Hammack, R., Imrich, W., & Klavžar, S. (2011). Handbook of product graphs. CRC Press.
Maryati, T.K.,Salman, A.N.M., Baskoro, E. T,Ryan, J., & Miller, M. (2010). On H- supermagic labelings for certain shackles and amalgamations of a connected graph. Utilitas Mathematica,83(October 2016), 333-342
Mujib.A. (2011). Characteristics of shackle graph : Shack(K_n,v_((j,i) ),t),Shack(C_n,v_((j,i) ),t),& Shack(K_((n,m),) v_((rj,1) ),t). Axiom(Februari 2021): 125-132
Li, X., & Zhou, S. (2023). Total coloring of product graphs and its applications. Journal of Combinatorial Optimization, 45, 1–15.
Sun, Y., & Wang, L. (2022). Total coloring of corona product graphs. Discrete Applied Mathematics, 308, 1–10.
Utari, A. (2019). Bilangan Kromatik Graf Hasil Operasi dan Aplikasinya Pada Permainan Pewarnaan Graf. 45(45), 95–98.
Vizing, V. G. (1968). Some unsolved problems in graph theory. Russian Mathematical Surveys, 23(6), 125–141.
Wang, W., & Wu, J. (2020). Total coloring of some special graphs. Discrete Mathematics, 343(5), 111800.
Zhao, Y., & Zhang, L. (2021). On total coloring of graphs with bounded degree. Graphs and Combinatorics, 37(2), 345–356.
DOI: http://dx.doi.org/10.25157/teorema.v11i1.19050
Refbacks
- Saat ini tidak ada refbacks.
##submission.copyrightStatement##
Laman Teorema: https://jurnal.unigal.ac.id/index.php/teorema/index
Terindek:
