Loading...
On the dynamic coloring of strongly regular graphs
Akbari, S ; Sharif University of Technology
598
Viewed
- Type of Document: Article
- Abstract:
- A proper vertex coloring of a graph G is called a dynamic coloring if for every vertex ν with degree at least 2, the neighbors of ν receive at least two different colors. It was conjectured that if G is a regular graph, then χ2(G) - χ (G) ≤ 2. In this paper we prove that, apart from the cycles C4 and C5 and the complete bipartite graphs Kn,n, every strongly regular graph G, satisfies χ2(G) - χ (G) ≤ 1
- Keywords:
- Dynamic coloring ; Strongly regular graphs
- Source: Ars Combinatoria ; Vol. 113 , 2014 , pp. 205-210 ; ISSN: 03817032