关于图的拟拉普拉斯矩阵的永久式

On the Permanent of the Quasi-Laplacian Matrix of Graphs

设G是一简单无向图,A(G)为G的邻接矩阵,D(G)为G的顶点度对角矩阵,Q(G)=D(G)-A(G)称为G的拟拉普拉斯矩阵 本文研究Q(G)的永久式,得到perQ(G)的两个表示公式及perQ(G)

Let G be a simple undirected graph, A(G)is the adjacency matrix,D(G)is the diagonal matrix of degree of vertex of G.The matrix Q(G)=A(G)+D(G) be called the quasi-Laplacian matrix of G.This paper investigates the permanent of Q(G),gives two denote formulas and some lower bounds.