Search
Now showing items 1-2 of 2
The 2-Distance Chromatic Number of Some Wheel Related Graphs
(Far East Journal of Mathematical Sciences (FJMS), Volume 103, Number 3, 2018, Pages 645-657, 2018-02-09)
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 ...
On the r-Dynamic Chromatic Number of the Corronation by Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033, 2018-04-27)
In this paper we will study the r-dynamic chromatic number of the coronation
by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v
receive at least minfr; d(v)g di®erent colors. The ...