Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Prosiding Seminar Matematika dan Pendidikan Matematik
Artanty Nastiti, Artanty
Unknown Affiliation
Education Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Rainbow Connection Number of Special Graph and Its Operations Nastiti, Artanty; Dafik, Dafik
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1, No 1 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

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}$.
Rainbow Connection Number of Special Graph and Its Operations Nastiti, Artanty; Dafik, Dafik
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

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}$ $\bigodot$ $Pr_{n}$, tensor product of $P_{2}$ $\bigotimes$ $W_{n}$.
Co-Authors D. Dafik