Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Jurnal Riset Mahasiswa Matematika
Anwar, Nurul Hafidhoh
Unknown Affiliation
Mathematics

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

Found 1 Documents
Search

 1 
Bilangan Kromatik Titik dari Dual Graf Berlian Anwar, Nurul Hafidhoh; Jauhari, Mohammad Nafie; Ismiarti, Dewi
Jurnal Riset Mahasiswa Matematika Vol 1, No 6 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v1i6.14517

Abstract

A vertex coloring of a graph , is an assigments of colors to the vertices of , such that no two adjacent vertices are assigned the same color. The least number of colors needed for an vertices coloring of a graph  is the chromatic number, denoted by . A graph is said to be planar if it can be drawn in the plane so that no edges crossing except at endpoints. A dual graph is constructed from the planar graph. Each region in planar graph can be represented by a vertex of the dual graph. Two vertices are connected if the region represented by these vertices are neugbours and have a common border. A diamond graph denoted by , can be used to model structure networks. In this study, it is shown that the chromatic number of dual diamond graph is  χ(〖Br_n〗^* )={█(3,n=2 and n≥4@4,n=3.)┤
Co-Authors Ismiarti, Dewi Mohammad Nafie Jauhari