  A nut graph is a simple graph whose adjacency matrix has the eigenvalue zero
with multiplicity one such that its corresponding eigenvector has no zero
entries. It is known that there exist no cubic circulant nut graphs. A
bicirculant (resp. tricirculant) graph is defined as a graph that admits a
cyclic group of automorphisms having two (resp. three) orbits of vertices of
equal size. We show that there exist no cubic bicirculant nut graphs and we
provide a full classification of cubic tricirculant nut graphs.
