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

Rainbow Connection Number of Special Graph and Its Operations

Nastiti, Artanty (Unknown)
Dafik, Dafik (Unknown)

Article Info

Publish Date
29 Dec 2014

Abstract

Let $G$ be a simple graph. An edge-coloring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to make rainbow connected. The rainbow connection numbers of a connected graph $G$, denoted $rc(G)$. In this paper we will discuss the rainbow connection number $rc(G)$ for some special graph and  its operations, namely crown product of $P_{2}$ $igodot$ $Pr_{n}$, tensor product of $P_{2}$ $igotimes$ $W_{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 ...