The 2-Distance Chromatic Number of Some Wheel Related Graphs
Let ( )EVG , be a simple and connected graph of vertex set V and edge set E. By the 2-distance chromatic number of a graph G, we mean a map ( ) { }k c GV ,1 ,2 ,3 ..., : → such that any two vertices at distance at most two from each other have different colors. The minimum number of colors in 2-dist...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Academic Paper |
| Published: |
Far East Journal of Mathematical Sciences (FJMS), Volume 103, Number 3, 2018, Pages 645-657,
2020-06-25T04:58:27Z.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let ( )EVG , be a simple and connected graph of vertex set V and edge set E. By the 2-distance chromatic number of a graph G, we mean a map ( ) { }k c GV ,1 ,2 ,3 ..., : → such that any two vertices at distance at most two from each other have different colors. The minimum number of colors in 2-distance chromatic number of G is its 2-distance chromatic number, denoted by ( ). 2 Gχ In this paper, we study the 2-distance chromatic number of some wheel related graphs, and obtain the 2-distance chromatic number of ( ), 2 nWχ ( ), 2 nFχ 2 ( )nH χ and ( )nW ,2 2 χ for . |
|---|---|
| Item Description: | http://repository.unej.ac.id/handle/123456789/99377 KODEPRODI0210101#Pendidikan Matematika NIDN0002057606 NIDN0001016827 |