Article Per Year (5 Year)
p-Index From 2021 - 2026
2.832
P-Index
This Author published in this journals
All Journal CAUCHY: Jurnal Matematika Murni dan Aplikasi BAREKENG: Jurnal Ilmu Matematika dan Terapan Jurnal Tadris Matematika EDUPEDIA Jurnal Ilmu Pendidikan (JIP) STKIP Kusuma Negara INTEGRITAS : Jurnal Pengabdian INCARE Mosharafa: Jurnal Pendidikan Matematika SCIENCE : Jurnal Inovasi Pendidikan Matematika dan IPA Prosiding Konferensi Nasional Penelitian Matematika dan Pembelajarannya Journal of Mandalika Literature Journal of Digital Literacy and Volunteering Jurnal Tadris Matematika Journal of Digital Literacy and Volunteering
WIHARDJO, EDY
Unknown Affiliation
Religion Agriculture, Biological Sciences & Forestry Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Energy Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

Published : 21 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 21 Documents
Search

 1   2   3 
b-Chromatic Number of Tree Graph Families Prihandini, Rafiantika Megahnia; Kristiana, Arika Indah; Dana, Lusita Risma; Wihardjo, Edy; Adawiyah, Robiatul; Zulnaidi, Hutkemri
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 11, No 1 (2026): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/cauchy.v11i1.32328

Abstract

Tree graph is a connected graph and has no circuits. Tree graphs used in this study include: broom graph, firework graph, banana tree graph, centipede graph, E graph, and double star graph. Graph coloring is the process of giving color to graph elements with the rule that neighboring elements must not have the same color and the number of colors used must be as minimal as possible. b-Coloring of a graph G is a coloring of the vertices of G such that each color class has at least one vertex adjacent to all other color classes. The b-Chromatic number of a graph G is denoted by φ (G), is the largest integer k such that G has a b-coloring with k colors. The limit of b-coloring of graph G with maximum degree ∆(G) is as follows. χ(G)≤φ(G)≤∆(G)+1.χ(G) is the chromatic number of a graph G where χ(G) is the minimum value of the color required for proper coloring of graph G. While ∆(G) is the maximum degree of the vertices in graph G. This study uses an exploratory research type with axiomatic deductive method and pattern detection method. Based on the results of this study, the results of the b-coloring analysis on the tree graph family are known. The results of this study are expected to be used as study material and development of scientific knowledge related to b-coloring of other graphs
Co-Authors AA Sudharmawan, AA Agustina, Rika Hasmayanti Aji, Ahmad Alfiyanto, Afif Andinna Ananda Yusuff Annastasia Putri, Fiorent Arif Fatahillah Arika Indah Kristiana Cahya, Ine Clarita CahyaPrihandoko, Antonius D. Dafik Dana, Lusita Risma Darmadi, D Deddy Setiawan Erfan Yudianto Ervin Oktavianingtyas Fardhoni, Fardhoni Indah Kristiana, Arika Iswahyu Pranawukir Karim Karim, Karim Karim, K Lioni Anka Monalisa, Lioni Anka Megahnia Prihandini, Rafiantika Mubarokah, Umi NAJIB, MOCHAMMAD IDFANI WAHIB Nurbuono, Mousthapaa Nurfauziana, Tazkia Priyanti, Nanda Rahma Puspaningrum, Diah R. Ati Sukmawati, R. Ati Rafiantika Megahnia Prihandini Randi Pratama Murtikusuma Robiatul Adawiyah Saddam Hussen Santoso, Aji Mansur Saranta, Nira Nityasa Sari, Dini Yurindiana Setiawan, Mohammad Febry Saputra Sri Subekti Sudi Prayitno Suhendri Suhendri Susanto Susanto Susi Setiawani Sutrisno, Sutrisno Syatria Adymas Pranajaya Zahra, Amanatta Zulnaidi, Hutkemri