Skip to search formSkip to main contentSkip to account menu

Graph homomorphism

Known as: Digraph morphism, Graph monomorphism, Graph morphism 
In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
  • H.
  • 2015
  • Corpus ID: 15006567
In this paper we show how the restriction of the complex algebraic cycles to real part of a complex algebraic set îs related to… 
2010
2010
We prove a conjecture of Alon on the number of independent sets in a regular graph, and then generalize to graph homomorphisms. 
2008
2008
In this paper we obtain the LU-decomposition of a noncommutative linear system of equations that, in the rank one case… 
2008
2008
Let Z be the set of integers, n a positive integer and (Z, ◦n) the hypergroup where x ◦n y = x + y + nZ for all x, y ∈ Z. Denote… 
2007
2007
This paper presents a combinatorial, structure based approach to the problem of finding a (di)similarity measure between two… 
1997
1997
In this thesis we study finite graphs and graph homomorphisms from both, a theoretical and a practical view point. A homomorphism… 
1995
1995
In this paper, trellis group codes are introduced as an extension of Slepian group codes to codes over sequence spaces. A trellis… 
1995
1995
for each a ∈ A. We denote the top and bottom elements of a σ-frame A respectively by 1A and 0A. σ-Frame homomorphisms preserve… 
1977
1977
Let k be an algebraically closed field of characteristic p and G a finite group such thatp divides the order of G. We compute all… 
1972
1972
Let X be a Poincare space of dimension rn, i. e. there is an element [X]EHm(X) such that [X]n: Hq(X)--+Hm_q(X) is an isomorphism…