一类2n阶图的邻接矩阵的行列式研究

On the Determinant of Adjacency Matrix of a Family of Graphs of Order 2n

在图论中,图的邻接矩阵是研究图的一个强有力的工具,而其行列式在研究图的结构性质时起到了非常重要的作用,从而受到人们的广泛关注。计算图的邻接矩阵的行列式通常可以采用图论的方法或代数的方法.本文利用线性代数中计算行列式的基本技巧,计算了一类2n阶简单无向图的邻接矩阵的行列式.

Adjacency matrix is a powerful tool in the study of graph theory.The determinant of adjacency matrix of a graph plays a very important role in studying the structure properties of the graph,which has attracted extensive attentions.The determinant of adjacency matrix of a graph can usually be calculated by the methods from graph theory or algebra.In this paper,by applications of some basic techniques for computing the determinant in linear algebra,the determinant of the adjacency matrix of a family of simple undirected graphs of order is obtained.