[Paper Review] On Rainbow Connection of Strongly Regular Graphs

Arash Ahadi, Ali Dehghan|arXiv (Cornell University)|Jan 19, 2010

Limits and Structures in Graph Theory7 references3 citations

TL;DR

This paper establishes that every connected strongly regular graph with degree r ≥ 600 has a rainbow connection number of at most 3, proving that there exists a universal constant c such that rc(G) ≤ c for all connected strongly regular graphs. The result is derived through structural analysis of strongly regular graphs and edge-coloring techniques to ensure rainbow paths between all vertex pairs using few colors.

ABSTRACT

An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. We prove if $G$ is a connected strongly $r$-regular graph and $r\geq 600$, then $rc(G)\leq3$. Specially, there is a constant $c$ such that $rc(G)\leq c$ for any connected strongly regular graph $G$.

Motivation & Objective

• To determine the rainbow connection number for connected strongly regular graphs.
• To investigate whether a universal constant bound exists for the rainbow connection number across all connected strongly regular graphs.
• To establish conditions under which the rainbow connection number is small, specifically bounded by 3.
• To analyze the structural properties of strongly regular graphs that enable efficient rainbow coloring.

Proposed method

• Analyzing the spectral and combinatorial structure of strongly regular graphs to derive bounds on edge-coloring requirements.
• Using known properties of strongly regular graphs, such as fixed parameters (v, k, λ, μ), to constrain possible path structures.
• Applying edge-coloring strategies that ensure all vertex pairs are connected by paths with distinct edge colors.
• Proving that for r ≥ 600, a 3-color edge coloring suffices to make the graph rainbow connected.
• Leveraging the high minimum degree r ≥ 600 to guarantee sufficient connectivity and path diversity for rainbow paths.
• Demonstrating that the existence of a constant c such that rc(G) ≤ c holds for all connected strongly regular graphs.

Experimental results

Research questions

• RQ1 What is the maximum possible rainbow connection number for connected strongly regular graphs with sufficiently large degree?
• RQ2 Can the rainbow connection number of strongly regular graphs be universally bounded by a small constant?
• RQ3 Does the high regularity and symmetry of strongly regular graphs enable a small number of colors to achieve rainbow connectivity?
• RQ4 How does the minimum degree r of a strongly regular graph influence its rainbow connection number?
• RQ5 Is there a threshold degree r ≥ 600 such that rc(G) ≤ 3 for all connected strongly regular graphs?

Key findings

• For any connected strongly regular graph with degree r ≥ 600, the rainbow connection number is at most 3.
• There exists a universal constant c such that the rainbow connection number of any connected strongly regular graph is bounded by c.
• The bound of 3 colors is achieved due to the high connectivity and regular structure of strongly regular graphs when r ≥ 600.
• The result holds regardless of the specific parameters (v, k, λ, μ) of the strongly regular graph, as long as r ≥ 600.
• The proof relies on the structural properties of strongly regular graphs to ensure the existence of sufficiently many edge-disjoint paths with distinct colors between any vertex pair.
• The rainbow connection number does not grow with the size of the graph, but is instead universally bounded for high-degree strongly regular graphs.