Edge-reflection positivity and weighted graph homomorphisms
β Scribed by Regts, Guus
- Book ID
- 126553140
- Publisher
- Elsevier Science
- Year
- 2015
- Tongue
- English
- Weight
- 353 KB
- Volume
- 129
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s
## Abstract A (1,2)βeulerian weight __w__ of a grph is hamiltonian if every faithful cover of __w__ is a set of two Hamilton circuits. Let __G__ be a 3βconnected cubic graph containing no subdivition of the Petersen graph. We prove that if __G__ admits a hamiltonian weight then __G__ is uniquely 3β