AN EFFICIENT METHOD FOR IDENTIFYING LAPLACIAN SPECTRUM

In this paer, an efficient method used for finding eigenvalues and eigenvectors of symmetric graphs. These method besed on the decomposing the grapgs into two components. There are interesting relationshipes between the properties of a graph and the Laplacian spectrum. The resulting method, find the eigenvalues, decreasess the size of the eigenvalues problems and correspondingly increases the accuracy of their solutions and omits extera computations and correspondingly reduces the computational time.

Keywords:

symmetric graphs , Laplacian matrix , eigenvalues , symmetric component