On the r-Dynamic Chromatic Number of the Corronation by Complete Graph

Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/99371

Full metadata record

DC Field	Value	Language
dc.contributor.author	KRISTIANA, Arika Indah	-
dc.contributor.author	UTOYO, Muhammad Imam	-
dc.contributor.author	DAFIK, Dafik	-
dc.date.accessioned	2020-06-25T04:35:44Z	-
dc.date.available	2020-06-25T04:35:44Z	-
dc.date.issued	2018-04-27	-
dc.identifier.uri	http://repository.unej.ac.id/handle/123456789/99371	-
dc.description.abstract	In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least minfr; d(v)g di®erent colors. The r-dynamic chromatic number, Âr(G) is the minimum k such that graph G has an r-dynamic k-coloring. We will obtain lower bound of the r-dynamic chromatic number of Âr(Kn ¯ H), and Âr(H ¯ Km) We also study the exact value of the r-dynamic chromatic number of Âr(Kn ¯ Sm); Âr(Kn ¯ Fm); Âr(Sn ¯ Km); Âr(Fn ¯ Km) and Âr(Kn ¯ Km) for m; n ¸ 3.	en_US
dc.language.iso	en	en_US
dc.publisher	IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033	en_US
dc.subject	r-dynamic chromatic number	en_US
dc.subject	corronation	en_US
dc.subject	complete graph	en_US
dc.title	On the r-Dynamic Chromatic Number of the Corronation by Complete Graph	en_US
dc.type	Article	en_US
dc.identifier.kodeprodi	KODEPRODI0210101#Pendidikan Matematika	-
dc.identifier.nidn	NIDN0002057606	-
dc.identifier.nidn	NIDN0001016827	-
Appears in Collections:	LSP-Jurnal Ilmiah Dosen

Files in This Item:

File	Description	Size	Format
F. KIP_Jurnal_Arika Indah K_On the r-dynamic chromatic number.pdf		3.8 MB	Adobe PDF	View/Open

DSpace JSPUI