Graph homomorphismMorphisme de graphes
Structure-preserving correspondence between node-link graphs
In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure.Un morphisme de graphes ou homomorphisme de graphes est une application entre deux graphes (orientés ou non orientés) qui respecte la structure de ces graphes.
