a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.