Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Eksakta : Berkala Ilmiah Bidang MIPA
Aisyah Nurinsani
Department of Mathematics and Data Science, Faculty of Mathematics and Natural Science (FMIPA), Universitas Andalas, Padang, Indonesia
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Energy Engineering Environmental Science Materials Science & Nanotechnology Mathematics Mechanical Engineering

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

Found 1 Documents
Search

 1 
On the Rainbow Connection Number for Snowflake Graph Lyra Yulianti; Muhammad Rafif Fajri; Des Welyyanti; Aisyah Nurinsani
EKSAKTA: Berkala Ilmiah Bidang MIPA Vol. 24 No. 01 (2023): Eksakta : Berkala Ilmiah Bidang MIPA (E-ISSN : 2549-7464)
Publisher : Faculty of Mathematics and Natural Sciences (FMIPA), Universitas Negeri Padang, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/eksakta/vol24-iss01/374

Abstract

Let G be an arbitrary non-trivial connected graph. An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors, such path is called a rainbow path. The smallest number of colors required to make G rainbow connected is called the rainbow connection number of G, denoted by rc(G). A snowflake graph is a graph obtained by resembling one of the snowflake shapes into vertices and edges so that it forms a simple graph. Let  be a generalized snowflake graph, i.e., a graph with  paths of the stem,  pair of outer leaves,  middle circles, and  pairs of inner leaves. In this paper we determine the rainbow connection number for generalized snowflake graph .
Co-Authors Des Welyyanti Muhammad Rafif Fajri Yulianti, Lyra