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
Arnasyitha Yulianti S, Arnasyitha
Unknown Affiliation
Education Mathematics

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

Found 2 Documents
Search

 1 
Rainbow Connection Number Pada Operasi Graf Yulianti S, Arnasyitha; 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

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}$.}
Rainbow Connection Number Pada Operasi Graf Yulianti S, Arnasyitha; 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

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}$.}
Co-Authors D. Dafik