  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.
