CD Skripsi
Rata-Rata Bilangan 2-Dominasi Bawah Untuk Graf Jahangir
This final project discusses the average lower 2-domination number of Jahangir graphs J2,m and J3,m. The determination of the average lower 2-domination number is done by analyzing the characteristics of the 2-domination set of these Jahangir graphs with values m = 2, 3, 4, 5 and 6. The results show the formula for the average lower 2-domination number for Jahangir graphs J2,m and J3,m also how the vertices of the 2-domination set in both types of graphs dominate the remaining vertices. This research contributes to understanding the domi- nation characteristics of Jahangir graphs that can be utilized for further graph theory development.
Keywords: Jahangir graph, average lower 2-domination number, 2-dominati- on set, graph connectivity
Tidak tersedia versi lain