✦ LIBER ✦

On homomorphic images of transition graphs

✍ Scribed by Michael Yoeli; Abraham Ginzburg

Publisher: Elsevier Science
Year: 1964
Tongue: English
Weight: 296 KB
Volume: 278
Category: Article
ISSN: 0016-0032
DOI: 10.1016/s0016-0032(64)90583-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph Homomorphisms and Phase Transition

Graph Homomorphisms and Phase Transitions

✍ Graham R. Brightwell; Peter Winkler 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 627 KB

We model physical systems with ``hard constraints'' by the space Hom(G, H) of homomorphisms from a locally finite graph G to a fixed finite constraint graph H. For any assignment \* of positive real activities to the nodes of H, there is at least one Gibbs measure on Hom(G, H); when G is infinite, t

Homomorphic images of solvable Lie algeb

Homomorphic images of solvable Lie algebras

✍ Gunnar Sigurđsson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Homomorphic images of linear sequential

Homomorphic images of linear sequential machines

✍ Juris Hartmanis; Wayne A. Davis 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 399 KB

In this paper we investigate homomorphisms on the state behavior of linear machines and characterize their homomorphic images. These results are then applied to characterize those nonlinear machines which can be realized by larger linear machines.

A modified homomorphic approach on invar

A modified homomorphic approach on invariant features of object images

✍ Yung-Tsan Lin; Ning Fang; Ming-Chieh Cheng; Shu-Min Chiang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 624 KB

On recognizing graphs by numbers of homo

On recognizing graphs by numbers of homomorphisms

✍ Zdeněk Dvořák 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract Let hom (__G, H__) be the number of homomorphisms from a graph __G__ to a graph __H__. A well‐known result of Lovász states that the function hom (·, __H__) from all graphs uniquely determines the graph __H__ up to isomorphism. We study this function restricted to smaller classes of gra

On Random Graph Homomorphisms into Z

✍ Itai Benjamini; Olle Häggström; Elchanan Mossel 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Given a bipartite connected finite graph G=(V, E) and a vertex v 0 # V, we consider a uniform probability measure on the set of graph homomorphisms f : V Ä Z satisfying f (v 0 )=0. This measure can be viewed as a G-indexed random walk on Z, generalizing both the usual time-indexed random walk and tr