Christopher, Peter R.
The goal of this project is to analyze families of small graphs with one or two loops at various vertices. We examine their adjacency matrices and Kronecker Products and determine their corresponding spectra. We describe features of the graphs and derive the number of closed walks. The degrees of each vertex, expressions for the spectra of each graph, and the correlating multiplicities of the eigenvalues were found through pattern recognition and implementation of the Binomial Theorem and a generating function.
Worcester Polytechnic Institute
Major Qualifying Project
All authors have granted to WPI a nonexclusive royalty-free license to distribute copies of the work, subject to other agreements. Copyright is held by the author or authors, with all rights reserved, unless otherwise noted.