Enumeration of perfect matchings of a type of Cartesian products of graphs
Authors:
- 1 January 2006
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (1) , 145-157
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Even Circuits of Prescribed Clockwise ParityThe Electronic Journal of Combinatorics, 2003
- Permanents, Pfaffian Orientations, and Even Directed CircuitsAnnals of Mathematics, 1999
- Permanents, Pfaffian orientations, and even directed circuits (extended abstract)1997
- Enumeration of Perfect Matchings in Graphs with Reflective SymmetryJournal of Combinatorial Theory, Series A, 1997
- Perfect matchings and perfect squaresJournal of Combinatorial Theory, Series A, 1994
- Proof of the generalized expressions for the number of perfect matchings of polycube graphsJournal of Mathematical Chemistry, 1989
- A characterization of convertible (0, 1)-matricesJournal of Combinatorial Theory, Series B, 1975
- A Graphical Model of a Class of MoleculesInternational Journal of Mathematical Education in Science and Technology, 1973
- Dimer Statistics and Phase TransitionsJournal of Mathematical Physics, 1963
- Note on the method of molecular orbitalsMathematical Proceedings of the Cambridge Philosophical Society, 1940