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.

We consider bordered complex Hadamard matrices whose core is contained in the Bose-Mesner algebra of a strongly regular graph. Examples include matrix conference graph due to J. Wallis, F. Szollősi, and family given by Singh Dubey. In this paper, we prove that there are no other