A strongly regular graph with parameters ) , , , ( µ λ k v is a regular graph G with v vertices and k degree in which every two adjacent vertices have λ common neighbors and every two non-adjacent vertices have µ common neighbors. In this paper, we propose an algorithm which can be used to construct strongly regular graphs using quaternary complex Hadamard matrices. The order of the strongly regular graph generated by a quaternary complex Hadamard matrix of order n is 2 n . The proposed algorithm has been illustrated by generating a strongly regular graph of order 4 using quaternary complex Hadamard matrix of order 2. Further, higher order strongly regular graphs were tested using Java program. This algorithm could be used to construct strongly regular graphs of order 2 2n ; n∈Z^+.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.