Adjacency Spectra of Semigraphs
arXiv:2205.00715
Abstract
In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for largest eigenvalues. We study the eigenvalues of adjacency matrix of two types of star semigraphs.
22 pages, 9 figures