论文标题
具有给定度序列约束的Laplacian积分图
Laplacian integral graphs with a given degree sequence constraint
论文作者
论文摘要
令G为n个顶点上的图形。 g的拉普拉斯矩阵（用l（g）表示）定义为l（g）= d（g） - a（g），其中a（g）是g和d（g）的邻接矩阵是g的角度矩阵。在本文中，我们表征了所有连接图的所有L综合非双分化图，最多具有两个大于或等于三个的程度顶点。
Let G be a graph on n vertices. The Laplacian matrix of G, denoted by L(G), is defined as L(G) = D(G) - A(G), where A(G) is the adjacency matrix of G and D(G) is the diagonal matrix of the vertex degrees of G. A graph G is said to be L-integral is all eigenvalues of the matrix L(G) are integers. In this paper, we characterize all L-integral non-bipartite graphs among all connected graphs with at most two vertices of degree larger than or equal to three.
