g-TRANSITIVITY IN PLATONIC GRAPHS
In this paper, we study g-transitivity for a graph and in each platonic graph we analyze it in detail. For each platonic graph: the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, and icosahedral graph, we characterize their g-sets and decide if they satisfy the condition for being a g-transitive graph.
platonic graphs, g-transitivity, domination.
