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

DOI10.1016/J.DISC.2023.113427zbMATH Open1515.05147arXiv2106.02919OpenAlexW4361204462MaRDI QIDQ6041554FDOQ6041554

Authors: Shuli Li, Danyi Li, Weigen Yan 

Publication date: 31 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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)cupE(G)$ and edge set $E(L(G))cupue,ve|foralle=uvinE(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.

Full work available at URL: https://arxiv.org/abs/2106.02919

Recommendations

• Dimer problem for some three dimensional lattice graphs
• Vertex-edge domination in cubic graphs
• On the cubicity of certain graphs
• On the anti-Kekulé problem of cubic graphs
• On the monomer-dimer problem of some graphs
• Dualizing cubic graph theory
• On Polyhedral Embeddings of Cubic Graphs
• Cubical graphs and cubical dimensions
• On the cubicity of bipartite graphs
• Diameters of cubic graphs

zbMATH Keywords

cubic graphdimer problemsilicate networkhexagonal latticevertex-edge graph

Mathematics Subject Classification ID

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)

Cites Work

• Matching theory
• Title not available (Why is that?)
• Permanents, Pfaffian orientations, and even directed circuits
• Enumeration of perfect matchings in graphs with reflective symmetry
• The Complexity of Enumeration and Reliability Problems
• On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
• Perfect matchings and perfect powers
• Even circuits of prescribed clockwise parity
• Title not available (Why is that?)
• DIMERS ON TWO-DIMENSIONAL LATTICES
• Counting 1-factors in regular bipartite graphs
• Graphs with 1-Factors
• Title not available (Why is that?)
• A complementation theorem for perfect matchings of graphs having a cellular completion
• Perfect matchings of cellular graphs
• On the number of perfect matchings of line graphs
• Enumeration of spanning trees of middle graphs
• Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
• Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
• Perfect matchings of Fisher graphs of cubic graphs

Cited In (4)

• Dimer problem for some three dimensional lattice graphs
• Title not available (Why is that?)
• An improved upper bound for the \(3\)-dimensional dimer problem
• Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 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)