Rainbow Connection Number Pada Operasi Graf

  • Arnasyitha Yulianti S
  • Dafik Dafik


An edge-colouring of a graph $G$ is rainbow connected if  there are $k$ internally vertex-disjoint paths joining them, with no two edges on the path have the same color. Let $G$ be a simple graph and $f$ be an edge coloring, where $f:E(G)\rightarrow{\{1,2,...,k\},\,\, k\in{N}}$, and the adjacent edges may have the same colour. The rainbow connection numbers of a connected graph G, denoted by $rc(G)$, is a minimal numbers of color $G$ required to make a rainbow connection. This paper discussed rainbow connection for any special graph, namely graph $P_n\otimes H_{2,2}$ and graph $P_3\otimes C_{n}$.}
How to Cite
YULIANTI S, Arnasyitha; DAFIK, Dafik. Rainbow Connection Number Pada Operasi Graf. Prosiding Seminar Matematika dan Pendidikan Matematik, [S.l.], v. 1, n. 5, nov. 2014. Available at: <https://jurnal.unej.ac.id/index.php/psmp/article/view/911>. Date accessed: 23 may 2024.
Prosiding Seminar Nasional Matematika 2014