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.
Das, A. and Saha, M. (2020). Determining Number of Some Families of Cubic Graphs. Journal of Algebra and Related Topics, 8(2), 39-55. doi: 10.22124/jart.2020.16856.1209
MLA
Das, A. , and Saha, M. . "Determining Number of Some Families of Cubic Graphs", Journal of Algebra and Related Topics, 8, 2, 2020, 39-55. doi: 10.22124/jart.2020.16856.1209
HARVARD
Das, A., Saha, M. (2020). 'Determining Number of Some Families of Cubic Graphs', Journal of Algebra and Related Topics, 8(2), pp. 39-55. doi: 10.22124/jart.2020.16856.1209
CHICAGO
A. Das and M. Saha, "Determining Number of Some Families of Cubic Graphs," Journal of Algebra and Related Topics, 8 2 (2020): 39-55, doi: 10.22124/jart.2020.16856.1209
VANCOUVER
Das, A., Saha, M. Determining Number of Some Families of Cubic Graphs. Journal of Algebra and Related Topics, 2020; 8(2): 39-55. doi: 10.22124/jart.2020.16856.1209
)