Search Results
Found one item.
-
On the Rainbow Connection Number for Snowflake Graph
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...Lyra Yulianti
,
Muhammad Rafif Fajri
,
Des Welyyanti
,
Aisyah Nurinsani