摘要
一个连通的简单图G如果含有三个无公共顶点的圈,则称G是无交三圈图.文章给出了无交三圈图的邻接矩阵是奇异的充分条件,邻接矩阵最大行列式为64.
A simple connected graph G is called a non-interactive three-circle graph when three cycles in G have no common vertices. This paper considers some sufficient conditions of the adjacency matrices of a graph with non-interactive three-circle and puts forward that the maximum determinant of the adjacency matrix of graphs with non-interactive three-circle is 64.
出处
《三明学院学报》
2008年第2期138-143,共6页
Journal of Sanming University
关键词
无交三圈图
完美匹配
邻接矩阵
non-interactive three-circle graphs
perfect matching
adjacency matrix
