Journal of Mathematical Sciences: Advances and ApplicationsAuthor's: Bo Gao, Lei Sun, Huimin Song and Hong-Jian Lai
Pages: [1] - [10]
Received Date: May 9, 2015
Submitted by:
DOI: http://dx.doi.org/10.18642/jmsaa_7100121494
For integers 
a 
of a graph G is a proper colouring
on the vertices of G by 
colours such that every vertex v of
degree 
is adjacent to vertices with at least
different colours. The dynamic chromatic
number, denoted by 
is the smallest integer for which a graph G has a 
In this paper, we prove a sufficient
condition for a 
graph G with 
Also, we give some upper bounds for
of 
graphs and graphs without even cycles.
chromatic number, dynamic chromatic number, graph, graph, even cycle.
