Bimorphism: f is called a bimorphism if f is both full and single.自同态（endomorphism）：任何同态f : X → X称为X上的一个自同态。Endomorphism: any homomorphism f: X → X is called an endomorphism on X.自同构（automorphism）：若一个自同态也是同构的，那么称之为自同构。Automorphism: if ...
An automorphism is defined as an isomorphism of a set with itself. Thus where an isomorphism is a one-to-one mapping between two mathematical structures an automorphism is a one-to-one mapping within a mathematical structure, a mapping of one subgroup upon another, for example. ...
5.2.3 Homomorphism, isomorphism and automorphism of groups Definition 5.3 Let (G, τ) and (G′, τ′) be two groups. An application f:Gτ→G′τ′R↦fR such that ∀R∈G,∀S∈G:fRτS=fRτ′fS is called an homomorphism of (G, τ) into (G′, τ′). If G and G′ have...
A graph is ultrahomogeneous if for any isomorphism f between finite induced subgraphs there is an automorphism of the ambient graph that extends f . A countable ultrahomogeneous relational structure is 蠅-categorical and eliminates quantifiers, so ultrahomogeneous structures are interesting from the ...
4. Automorphism (Sameness structure of self) = {Self + Isomorphism} 自同构 Analogy: A triangle and its image in a mirror; or A triangle and its rotated (clock-wise or anti-clock-wise), or reflected (flip-over) self. 5. Monomorphism 单同态 = Injective + Homomorphism 6. Epimorphism...
Homomorphism bounds and minors The core of a graph G is the smallest subgraph of G to which G admits a homomorphism (it is known to be unique up to isomorphism). A graph G is a core if it is its own core. For additional concepts in graph homomorphisms, we refer to the book by...
homomorphism-homogeneous structuresA structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism ... Dragan Masulovic - 《Order-a Journal on the Theory of Ordered Sets & Its Applications》 被引量: 51发表: 2007年 Finite homomorphism-hom...
(G, x¯) implements a vector v whose ith and jth components are different. 3.4 Pinning We now have almost everything we need to prove Theorem 3.1. Recall the definition of an enumeration y¯1, . . . , y¯λ of V (H)r up to isomorphism (Definition 3.7). Lemma 3.12. Let H...
A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently,... Andreja,Ilić,Dragan,... - 《Journal of Graph Theory》 被引量: 49发表: 2008年 Minimum cost homomorphisms to semicomplete multipartite dig...
isomorphism automorphism epimorphism See all related content homomorphism, (from Greekhomoios morphe, “similar form”), a special correspondence between the members (elements) of two algebraic systems, such as two groups, two rings, or two fields. Two homomorphic systems have the same basic struct...