ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Generation of Strongly Regular Graphs from Normalized Hadamard Matrices

Journal: International Journal of Scientific & Technology Research (Vol.2, No. 2)

Publication Date:

Authors : ; ; ;

Page : 210-215

Keywords : Index Terms - Adjacency matrix; Hadamard Matrices; k-regular graphs; Latin Square; Simple Graphs; Strongly Regular Graphs; Tensor Product.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Abstract - This paper proposes an algorithm which can be used to construct strongly regular graphs from Hadamard matrices.A graph G is strongly regular if there are integers 26955 and 26956 such that every two adjacent vertices have 26955 common neighbours and every two non adjacent vertices have 26956 common neighbors. Proposed method is mainly based on basic matrix manipulations. If the order of the normalized Hadamard matrix is n the resulting strongly regular graph will have n x n number of vertices. Therefore the simplest strongly regular graph generated from this method has 16 vertices since its predecessor normalized Hadamard matrix has the order of 4. This algorithm was implemented using C programming language. Then the algorithm was tested for large Hadamard matrices and the results proved that this method is correct and works for any normalized Hadamard matrix of order greater than or equal to 4.

Last modified: 2013-04-13 21:56:02