Article Per Year (5 Year)
p-Index From 2019 - 2024
1.048
P-Index
This Author published in this journals
All Journal Jurnal Edukasi Universitas Jember KADIKMA Saintifika EDU-MAT: Jurnal Pendidikan Matematika Dinamisia: Jurnal Pengabdian Kepada Masyarakat Unisda Journal of Mathematics and Computer Science (UJMC) Journal of Education and Learning Mathematics Research (JELMaR) JES-MAT (Jurnal Edukasi dan Sains Matematika) SAINTIFIKA
Reza Ambarwati
Pendidikan Matematika FKIP Unej
Agriculture, Biological Sciences & Forestry Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Education Health Professions Mathematics Medicine & Pharmacology Physics Social Sciences Other

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

Found 1 Documents
Search
Journal : Unisda Journal of Mathematics and Computer Science (UJMC)

 1 
KETERHUBUNGAN PELANGI KUAT (src) PADA GRAF (1 Spl-(Cn )) UNTUK 3 ≤ n ≤ 10 Ermita Rizki Albirri; Robiatul Adawiyah; Lela Nur Safrida; Reza Ambarwati
Unisda Journal of Mathematics and Computer Science (UJMC) Vol 4 No 1 (2018): Unisda Journal of Mathematics and Computer Science
Publisher : Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (334.29 KB) | DOI: 10.52166/ujmc.v4i1.844

Abstract

Let G be nontrivial and connected graph. A total-coloured path is called as total-rainbow if its edges and internal vertices have distinct colours. For any two vertices u and v of G, a rainbow u−v geodesic in G is a rainbow u−v path of length d(u,v), where d(u,v) is the distance between u and v. The graph G is strongly rainbow connected if there exists a rainbow u−v geodesic for any two vertices u and v in G. The strong rainbow connection number of G, denoted src(G), is the minimum number of colors that are needed in order to make G strong rainbow connected. The result shows for 1 Spl - (Cn) and 3 ≥ n ≥ 10 there exist a coloring where diam(G) = rc(G) = src(G) ≤ m and diam(G) ≤ rc(G) ≤ src(G) ≤ m with m is the number of path 1 Spl - (Cn).
Co-Authors Abi Suwito Ais Nuraini Dian Kurniati Didik Sugeng Pambudi Dinawati Trapsilasiwi Erfan Yudianto Ermita Rizki Albirri Guvinta Rahayu Hobri Jatmiko, Dhanar Dwi Hary Nur Izzatun Nisa Liliyan Nur Izzatun Nisa Liliyan Nurcholif Diah Sri Lestari Nuzula Erlisa Nuraziza Robiatul Adawiyah Sunardi, Sunardi Susanto Susanto Toto Bara Setiawan