Search Results
##search.searchResults.foundPlural##
-
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... -
On the Metric Dimension for Snowflake Graph
The concept of metric dimension is derived from the resolving set of a graph, that is measure the diameter among vertices in a graph. For its usefulness in diverse fields, it is interesting to find the metric...