Anna Bień
Published 2013-08-31, updated 2014-02-15Version 2
We analyse the problem of singularity of graphs for hexagonal grid graphs. We introduce methods for transforming weighted graph, which do not change the determinant of adjacency matrix. We use these methods to calculate the determinant of all hexagonal grid graphs which describe certain hexagon-shaped benzenoid systems. The final result is the explicit formula for the determinant of graphs $H_{k,n}$. From the theorem we draw the conclusion, that all graphs of this kind are non-singular.
Comments: 9 pages, 4 figures
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
The number of ideals of $\mathbb{Z}[x]$ containing $x(x-α)(x-β)$ with given index
![QR code for arXiv:1309.0087 [math.CO]](http://oss.arxitics.com/images/favicon.svg)