Dimensions
Dimensions
Rahayuningtyas, Handrini, Abdussakir, Abdussakir and Nashichuddin, Ach. 
ORCID: https://orcid.org/0009-0006-8273-8878
(2015)
Bilangan Kromatik Graf Commuting dan Non Commuting Grup Dihedral.
Cauchy: Jurnal Matematika Murni dan Aplikasi, 4 (1).
pp. 16-21.
ISSN 2086-0382
|
Text (Fulltext)
1717.pdf - Published Version Download (719kB) | Preview |
Abstract
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
| Item Type: | Journal Article |
|---|---|
| Keywords: | chromatic number; vertex colouring; edge colouring; commuting and noncommuting graph; dihedral group |
| Subjects: | 01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) 01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010105 Group Theory and Generalisations |
| Divisions: | Faculty of Mathematics and Sciences > Department of Mathematics |
| Depositing User: | Abdussakir Abdussakir |
| Date Deposited: | 31 Mar 2017 08:41 |
Downloads
Downloads per month over past year
Origin of downloads
Actions (login required)
 |
View Item |