Open AccessBilangan Kromatik Grap Commuting dan Non Commuting Grup Dihedral
Author(s) -
Handrini Rahayuningtyas,
Abdussakir Abdussakir,
Achmad Nashichuddin
Publication year - 2015
Publication title -
cauchy
Language(s) - English
Resource type - Journals
eISSN - 2477-3344
pISSN - 2086-0382
DOI - 10.18860/ca.v4i1.3169
Subject(s) - combinatorics , mathematics , vertex (graph theory) , wheel graph , dihedral group , graph , graph power , bound graph , abelian group , windmill graph , neighbourhood (mathematics) , discrete mathematics , physics , line graph , group (periodic table) , mathematical analysis , quantum mechanics
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