论文标题
邻接的指示灯
Adjacency Spectra of Semigraphs
论文作者
论文摘要
在本文中，我们定义了半径的邻接矩阵。我们给出了矩阵的条件，使其成为半径，并给出算法以构建半径矩阵的半径。我们为最大的特征值提供了下限和上限。我们研究了两种类型的星形半径的邻接矩阵的特征值。
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.
