70 search results - page 3 / 14 » The complexity of counting graph homomorphisms |
UC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
EJC
2008
13 years 5 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
LATIN
2010
Springer
13 years 10 months ago
2010
Springer
CC
2000
Springer
13 years 5 months ago
2000
Springer
DAM
2008
13 years 5 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...