Department of Mathematical Sciences, Shahid Beheshti University, G.C., P.O. Box 19839-63113, Tehran, Iran.
10.48308/cgasa.2026.242084.1578
Abstract
Edge coloring of a graph is a function from its edge set to the set of natural numbers (called colours). A path in an edge-colored graph with no two edges sharing the same color is called a rainbow path. An edge-colored graph is said to be rainbow connected if every pair of vertices is connected by at least one rainbow path. Such a coloring is called a rainbow coloring of the graph. The minimum number of colors required to rainbow color a connected graph is called its rainbow connection number, denoted by $rc(G)$. For example, the rainbow connection number of a complete graph is 1, that of a path is its length, and that of a star is its number of leaves. For a basic introduction to the topic, see Chapter 11 in \cite{Ch2} and for a comprehensive treatment of the area see the recent monograph by Li and Sun \cite{Li}. The concept of rainbow coloring was introduced in \cite{Ch1}.
Iradmusa, M. N and Farha, T. N (2026). On rainbow connection number of cartesian product of graphs. Categories and General Algebraic Structures with Applications, (), -. doi: 10.48308/cgasa.2026.242084.1578
MLA
Iradmusa, M. N, and Farha, T. N. "On rainbow connection number of cartesian product of graphs", Categories and General Algebraic Structures with Applications, , , 2026, -. doi: 10.48308/cgasa.2026.242084.1578
HARVARD
Iradmusa, M. N, Farha, T. N (2026). 'On rainbow connection number of cartesian product of graphs', Categories and General Algebraic Structures with Applications, (), pp. -. doi: 10.48308/cgasa.2026.242084.1578
CHICAGO
M. N Iradmusa and T. N Farha, "On rainbow connection number of cartesian product of graphs," Categories and General Algebraic Structures with Applications, (2026): -, doi: 10.48308/cgasa.2026.242084.1578
VANCOUVER
Iradmusa, M. N, Farha, T. N On rainbow connection number of cartesian product of graphs. Categories and General Algebraic Structures with Applications, 2026; (): -. doi: 10.48308/cgasa.2026.242084.1578
)