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!
|
Internet
Get Fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |