Prosiding Seminar Matematika dan Pendidikan Matematik
Vol 1, No 1 (2014): Prosiding Seminar Nasional Matematika 2014

Rainbow Connection Number Pada Operasi Graf

Yulianti S, Arnasyitha (Unknown)
Dafik, Dafik (Unknown)

Article Info

Publish Date
29 Dec 2014

Abstract

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) ightarrow{{1,2,...,k},,, kin{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_notimes H_{2,2}$ and graph $P_3otimes C_{n}$.}

Copyrights © 2014




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Prosiding Seminar Matematika dan Pendidikan Matematik
Website

Abbrev

PSMP

Publisher

Universitas Jember

Subject

Education Mathematics

Description

Prosiding Semnas Matematika dan Pendidikan Mamatika adalah prosiding kumpulan artikel hasil seminar nasional matematika dan pendidikan matematika. Tema semnas berbeda setiap terbitan disesuaikan dengan tema yang dikembangkan oleh panitia semnas. Terbit satu kali dalam setahun secara serial antara ...