#TITLE_ALTERNATIVE#
<p align="justify">The modular coloring in graph was introduced by Futaba Okamoto, Ebrahim Salehi and Ping Zhang in 2009. For 􀝇 􀵒 2, a modular 􀝇-coloring of a graph 􀜩 without isolated vertices is a coloring of the vertices of &#...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/30001 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | <p align="justify">The modular coloring in graph was introduced by Futaba Okamoto, Ebrahim Salehi and Ping Zhang in 2009. For 􀝇 􀵒 2, a modular 􀝇-coloring of a graph 􀜩 without isolated vertices is a coloring of the vertices of 􀜩 with the elements in 􀔺􀭩 (where adjacent vertices may be colored by the same color) having the property that for every two adjacent vertices of 􀜩, the sums of the colors of their neighbors are different in 􀔺􀭩. The modular chromatic number 􀝉􀜿􁈺􀜩􁈻 of 􀜩 is the minimum 􀝇 for which 􀜩 has a modular 􀝇-coloring. The modular chromatic number of a graph is at least the same as its chromatic number. The objective of this thesis is to determine the modular chromatic number of some unicyclic graphs, obtained by operation a cycle with stars, a cycle with a path and a star, and a cycle with paths.<p align="justify"> |
|---|