On the dimer problem of the vertex-edge graph of a cubic graph

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: Let

G

be a graph with vertex set

V (G)

and edge set

E (G)

, and

L (G)

be the line graph of

G

, which has vertex set

E (G)

and two vertices

e

and

f

of

L (G)

is adjacent if

e

and

f

is incident in

G

. The vertex-edge graph

M (G)

of

G

has vertex set

V (G) c u p E (G)

and edge set

E (L (G)) c u p u e, v e | f o r a l l e = u v i n E (G)

. In this paper, by a combinatorial technique, we show that if

G

is a connected cubic graph with an even number of edges, then the number of dimer coverings of

M (G)

equals

2^{| V (G) | / 2 + 1} 3^{| V (G) | / 4}

. As an application, we obtain the exact solution of the dimer problem of the weighted solicate network obtained from the hexagonal lattice in the context of statistical physics.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: On the dimer problem of the vertex-edge graph of a cubic graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041554)