Determining Number of Some Families of Cubic Graphs

Document Type : Research Paper

Authors

Department of Mathematics, Presidency University, Kolkata, India.

Abstract

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

A u t (G)

is trivial. In this paper, we compute the determining number of some families of cubic graphs.

Keywords