Article ID Journal Published Year Pages File Type
4648155 Discrete Mathematics 2011 11 Pages PDF
Abstract

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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
,