Graph homomorphismGraph homomorphism
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
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 function between the vertex sets of two graphs that maps adjacent vertices to adjacent vertices.
Excerpt from the Wikipedia article “Graph homomorphism”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Tokenzero, CC0, via Wikimedia Commons.
Open free boosters and add Graph homomorphism to your collection.
Play for free




