نتایج جستجو برای: frame homomorphism
تعداد نتایج: 104511 فیلتر نتایج به سال:
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). If, moreover, each vertex u ∈ V (D) is associated with costs ci(u), i ∈ V (H), then the cost of the homomorphism f is ∑ u∈V (D) cf(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem for H. The problem is to decide, for an input graph D with costs ci(u), u...
partial frames provide a rich context in which to do pointfree structured and unstructured topology. a small collection of axioms of an elementary nature allows one to do much traditional pointfree topology, both on the level of frames or locales, and that of uniform or metric frames. these axioms are sufficiently general to include as examples bounded distributive lattices, $sigma$-frames, $ka...
In this paper, a new concept of anti-homomorphism between two fuzzy groups G and G׀ is defined many results analogous to homomorphism of groups are established
Homomorphism complexes were introduced by Lovász to study topological obstructions to graph colorings. We show that folding in the second parameter of the homomorphism complex yields a homotopy equivalence. We study how the Mycielski construction changes the homotopy type of the homomorphism complex. We construct graphs showing that the topological bound obtained by odd cycles can be arbitraril...
On a closed symplectic surface Σ of genus two or more, we give a new construction of an extended flux map (a crossed homomorphism from the symplectomorphism group Symp(Σ) to the cohomology group H(Σ;R) that extends the flux homomorphism). This construction uses the topology of the Jacobian of the surface and a correction factor related to the Johnson homomorphism. For surfaces of genus three or...
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking an input graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in V(G)$, allowed images, to fixed target $(H,\pi)$. The complexity similar without (corresponding all being $L(v)=V(H)$) has been previously classified by Brewster and Siggers, but ve...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید