Homomorphisms of graphs - Open Access .click

Results 91 to 100 of about 238 (165)

Connected-homomorphism-homogeneous graphs

J. Graph Theory, 2012
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where "isomorphism" may be replaced by "homomorphism" or "monomorphism" in the definition.
openaire +3 more sources

The Multi-Cover Persistence of Euclidean Balls. [PDF]

Discrete Comput Geom, 2021
Edelsbrunner H, Osang G.
europepmc +1 more source

Distinguishing graphs by the number of homomorphisms

Discussiones Mathematicae Graph Theory, 1995
A homomorphism from one graph to another is a mapping that sends vertices to vertices and edges to edges. Let \(|G\to H|\) denote the number of homomorphisms from \(G\) to \(H\). For example \(|G\to K_n|\) is the number of \(n\)-colorings of \(G\). If \(\mathcal F\) is a collection of graphs, we say that \(\mathcal F\) distinguishes graphs \(G\) and ...
openaire +1 more source

Orthopseudorings and congruences on distributive lattice with dual weak complementation. [PDF]