No label defined (Q3972015)

[For the entire collection see Zbl 0698.00017.] A matching of a graph \(G\) is a subset of the edge set of \(G\) whose elements have pairwise no common end vertices; it is called perfect, if it covers all vertices of \(G\). A point lattice (to distinguish from the lattice in algebra) is a doubly periodic set \(S\) (i.e. such that there exist non-collinear vectors \(a\), \(b\) such that \(S+a=S+b=S\)) in the plane with no accumulation points. A lattice network is a doubly-periodic two- connected locally finite undirected plane graph whose vertex set is a point lattice. A subgraph \(G\) of a lattice network \(N\) induced by the vertices lying on a circuit \(C\) and in the interior of \(C\) is called a lattice graph. The balanced lattice graph is defined. The number of perfect matchings of such a graph \(G\) is computed as the absolute value of a certain determinant of order \(s\), where \(s\) is the number of sources of \(G\) in a certain auxiliary orientation.