Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Acyclic Edge-Coloring of Complete Bipartite Graphs

Published 11 Mar 2015 in cs.DM and math.CO | (1503.03283v1)

Abstract: An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic ($2$-colored) cycles. The acyclic chromatic index of a graph GG, denoted by a′(G)a'(G), is the least integer kk such that GG admits an acyclic edge-coloring using kk colors. Let Δ=Δ(G)\Delta = \Delta(G) denote the maximum degree of a vertex in a graph GG. A complete bipartite graph with nn vertices on each side is denoted by Kn,nK_{n,n}. Basavaraju, Chandran and Kummini proved that a′(Kn,n)≥n+2=Δ+2a'(K_{n,n}) \ge n+2 = \Delta + 2 when nn is odd. Basavaraju and Chandran provided an acyclic edge-coloring of Kp,pK_{p,p} using p+2p+2 colors and thus establishing a′(Kp,p)=p+2=Δ+2a'(K_{p,p}) = p+2 = \Delta + 2 when pp is an odd prime. The main tool in their approach is perfect $1$-factorization of Kp,pK_{p,p}. Recently, following their approach, Venkateswarlu and Sarkar have shown that K2p−1,2p−1K_{2p-1,2p-1} admits an acyclic edge-coloring using $2p+1$ colors which implies that a′(K2p−1,2p−1)=2p+1=Δ+2a'(K_{2p-1,2p-1}) = 2p+1 = \Delta + 2, where pp is an odd prime. In this paper, we generalize this approach and present a general framework to possibly get an acyclic edge-coloring of Kn,nK_{n,n} which possess a perfect $1$-factorization using n+2=Δ+2n+2 = \Delta+2 colors. In this general framework, we show that Kp2,p2K_{p^2,p^2} admits an acyclic edge-coloring using p2+2p^2+2 colors and thus establishing a′(Kp2,p2)=p2+2=Δ+2a'(K_{p^2,p^2}) = p^2+2 = \Delta + 2 when p≥5p\ge 5 is an odd prime.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.