Comparison of Spectra Using Matrix Representations for Sierpinski Graphs

Abstract

There are a wide variety of graph matrix representations, among these are the adjacency matrix, incidence matrix, circuit matrix, Laplacian matrix and Signless Laplacian matrix. Spectra of Sierpinski graph can also be derived by studying eigenvalues. The choice of matrix representation clearly has a large effect on the suitability of spectrum in a number of pattern recognition tasks. The objective of this research are to find possible results using graph matrix representation.