Show simple item record

dc.contributor.authorKRISTIANA, Arika Indah
dc.contributor.authorUTOYO, Muhammad Imam
dc.contributor.authorSLAMIN, Slamin
dc.contributor.authorALFARISI, Ridho
dc.contributor.authorAGUSTIN, Ika Hesti
dc.contributor.authorM. Venkatachalam
dc.date.accessioned2020-06-25T03:13:53Z
dc.date.available2020-06-25T03:13:53Z
dc.date.issued2019-03-03
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/99360
dc.description.abstractIn this paper we study a new notion of coloring type of graph, namely a local irregularity vertex coloring. We define is called vertex irregular -labeling and where . By a local irregularity vertex coloring, we define a condition for if for every and vertex irregular labeling . The chromatic number of local irregularity vertex coloring of , denoted by , is the minimum cardinality of the largest label over all such local irregularity vertex coloring. In this article, we study the local irregularity vertex coloring of some graphs and we have found the exact value of their chromatic numberen_US
dc.language.isoenen_US
dc.publishernternational Journal of Civil Engineering and Technology (IJCIET) Volume 10, Issue 03, March 2019, pp. 1606–1616en_US
dc.subjectIrregularity strengthen_US
dc.subjectlocal irregularityen_US
dc.subjectvertex coloringen_US
dc.subjectpathen_US
dc.subjectcycleen_US
dc.titleLocal Irregularity Vertex Coloring of Graphsen_US
dc.typeArticleen_US
dc.identifier.prodiNIDN0001088401
dc.identifier.kodeprodiKODEPRODI0210101#Pendidikan Matematika
dc.identifier.nidnNIDN0002057606
dc.identifier.nidnNIDN0020046701
dc.identifier.nidnNIDN0007119401


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record