LOCAL IRREGULARITY VERTEX COLORING OF GRAPHS
Journal: International Journal of Civil Engineering and Technology (IJCIET) (Vol.10, No. 3)Publication Date: 2019-05-08
Authors : ARIKA INDAH KRISTIANA DAFIK M. IMAM UTOYO SLAMIN RIDHO ALFARISI IKA HESTI AGUSTIN M. VENKATACHALAM;
Page : 1606-1616
Keywords : Irregularity strength; local irregularity; vertex coloring; path; cycle.;
Abstract
In 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 number
Other Latest Articles
- STUDY OF MOISTURE DIFFUSION IN CELLULAR CONSTRUCTIONAL MATERIALS
- BUILDING COMPOSITE MATERIALS BASED ON THE RECYCLED INDUSTRIAL MATERIALS
- BEHAVIOR OF EXTERIOR R.C BEAM COLUMN JOINT WITH STRENGTHENED CONCRETE AND DIAGONAL CROSS BRACINGS
- COMPARATIVE ANALYSIS OF FURAN RESIN MODIFIED ASPHALT MIX AND CONVENTIONAL ASPHALT MIX
- A STUDY OF BITUMINOUS MIXES WITH NATURAL FIBRE (SISAL FIBRE) BY EXPERIMENT
Last modified: 2019-05-17 22:54:20