The problem of singularity for planar grids

被引：3

作者：

Bien, Anna ^{[1
]}

机构：

[1] Univ Silesia, Inst Math, Katowice, Poland

来源：

DISCRETE MATHEMATICS | 2011年 / 311卷 / 12期

关键词：

Simple graph; Planar grid; Adjacency matrix; Singular graph;

D O I：

10.1016/j.disc.2011.02.027

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We consider simple graphs and their adjacency matrices. In [2], Rara (1996) gives methods of reducing graphs which simplify the procedure of computing the determinant of their adjacency matrices. We continue this subject matter and give a general method of reducing graphs. By the use of this method we define a formula for computing the determinant of any planar grid and in particular settle the problem of their singularity. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：921 / 931

页数：11