Search results

Graph morphism may refer to: Graph homomorphism, in graph theory, a homomorphism between graphs Graph morphism, in algebraic geometry, a type of morphism...

It is a special case of a graph morphism: given a morphism f : X → Y {\displaystyle f:X\to Y} over S, the graph morphism of it is X → X × S Y {\displaystyle...

connected component of the graph G {\displaystyle G} . In contrast a graph rewriting rule of the SPO approach is a single morphism in the category of labeled...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

morphism of schemes generalizes a morphism of algebraic varieties just as a scheme generalizes an algebraic variety. It is, by definition, a morphism...

Grph(E' ,G)) and morphism h: G → H to the pair of functions (Grph(V' ,h), Grph(E' ,h)) is faithful. That is, a morphism of graphs can be understood as...

object x, there exists a morphism 1x : x → x (some authors write idx) called the identity morphism for x, such that every morphism f : a → x satisfies 1x...

In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f : V ( G ) → V ( H ) {\displaystyle f\colon V(G)\to...

algebraic geometry. It roughly says that a proper morphism is fairly close to being a projective morphism. More precisely, a version of it states the following:...

In mathematics, the graph of a function f {\displaystyle f} is the set of ordered pairs ( x , y ) {\displaystyle (x,y)} , where f ( x ) = y . {\displaystyle...

for "morphism" or "arrow", which is a structure-respecting function and thus may imply more structure than "function" does. For example, a morphism f :...

some category, an automorphism is a morphism of the object to itself that has an inverse morphism; that is, a morphism f : X → X {\displaystyle f:X\to X}...

abelian varieties carry the structure of a group. A morphism of abelian varieties is a morphism of the underlying algebraic varieties that preserves...

over a scheme S and if i is an S-morphism, then i is a regular embedding. In particular, every section of a smooth morphism is a regular embedding. If Spec...

a pullback diagram, then the induced morphism ker(p2) → ker(f) is an isomorphism, and so is the induced morphism ker(p1) → ker(g). Every pullback diagram...

computer science: Can the graph isomorphism problem be solved in polynomial time? (more unsolved problems in computer science) The graph isomorphism problem...

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed...

graph morphism taking source and sink to v). The loop gain of a vertex v w.r.t. a subgraph H is the gain from source to sink of the signal-flow graph...

image of the module homomorphism M → M ⊕ N, x → (x, f(x)), called the graph morphism. The transpose of f is f ∗ : N ∗ → M ∗ , f ∗ ( α ) = α ∘ f . {\displaystyle...

G-maps. The composition of two morphisms is again a morphism. If a morphism f is bijective, then its inverse is also a morphism. In this case f is called an...