Main Article Content

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 .

Keywords

rainbow connection number snowflake graph bridges

Article Details

Author Biographies

Lyra Yulianti, Department of Mathematics and Data Science, Faculty of Mathematics and Natural Science (FMIPA), Universitas Andalas, Padang, Indonesia

lecturer in mathematical combinatorics at Andalas University

Des Welyyanti, Department of Mathematics and Data Science, Faculty of Mathematics and Natural Science (FMIPA), Universitas Andalas, Padang, Indonesia

lecturer in mathematical combinatorics at Andalas University

How to Cite
1.
Yulianti L, Fajri MR, Welyyanti D, Nurinsani A. On the Rainbow Connection Number for Snowflake Graph. EKSAKTA [Internet]. 2023Mar.30 [cited 2025Apr.5];24(01):19-2. Available from: https://eksakta.ppj.unp.ac.id/index.php/eksakta/article/view/374

References

Read More