On the Dynamic Coloring of Strongly Regular Graphs
Saieed Akbari, Maryam Ghanbari, Sogol Jahanbekam · San Jose State University Scholar Works (San Jose State University) · 2014
A proper vertex coloring of a graph G is called a dynamic coloring if for every vertex v with degree at least 2, the neighbors of v receive at least two different colors.It was conjectured that if G is a regular graph, then x^iG) -x{G) < 2. In this paper we prove that, apart from the cycles Ca and C5 and the complete bipartite graphs ATn.n, every strongly regular graph G, satisfies X2{G) -x(^) ^ 1-