Determining Number of Some Families of Cubic Graphs

The determining number of a graph G = (V,E) is the minimum cardinality of a set S\subseteq V such that pointwise stabilizer of S under the action of Aut(G) is trivial. In this paper, we compute the determining number of some families of cubic graphs.

کلیدواژه ها:

Automorphism groups ، fixing number ، cubic graphs