Bilangan Kromatik Graf Commuting dan Non Commuting Grup Dihedral
| Main Authors: | Rahayuningtyas, Handrini, Abdussakir, Abdussakir, Nashichuddin, Ach. |
|---|---|
| Format: | Journal PeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
Jurusan Matematika UIN Maulana Malik Ibrahim Malang
, 2015
|
| Subjects: | |
| Online Access: |
http://repository.uin-malang.ac.id/1717/2/1717.pdf http://repository.uin-malang.ac.id/1717/ http://ejournal.uin-malang.ac.id/index.php/Math/article/view/3169/5021 http://dx.doi.org/10.18860/ca.v4i1.3169 |
Daftar Isi:
- Commuting graph is a graph that has a set of points X and two different vertices to be connected directly if each commutative in G. Let G non abelian group and Z(G) is a center of G. Noncommuting graph is a graph which the the vertex is a set of G\Z(G) and two vertices x and y are adjacent if and only if xy≠yx. The vertex colouring of G is giving k colour at the vertex, two vertices that are adjacent not given the same colour. Edge colouring of G is two edges that have common vertex are coloured with different colour. The smallest number k so that a graph can be coloured by assigning k colours to the vertex and edge called chromatic number. In this article, it is available the general formula of chromatic number of commuting and noncommuting graph of dihedral group