On the determinant of hexagonal grids Hk,n
Abstract
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 Hk,n. From the theorem we draw the conclusion, that all graphs of this kind are non-singular.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.