𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Labelings of Graphs with Fixed and Varia
✍ Babilon, Robert; JelΓ­nek, VΓ­t; KrΓ‘l', Daniel; Valtr, Pavel πŸ“‚ Article πŸ“… 2007 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 347 KB
Computer generation of characteristic po
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 624 KB

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

Hamiltonian weights and unique 3-edge-co
✍ Cun-Quan Zhang πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 402 KB

## 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‐