Graph homomorphism
id:
graph-homomorphism-180-15668631
title:
Graph homomorphism
text:
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. Homomorphisms generalize various notions of graph colorings and allow the expression of an important class of constraint satisfaction problems, such as certain scheduling or frequency assignment problems.
The fact that homomorphisms can be composed le
brand slug:
wiki
category slug:
encyclopedia
description:
A structure-preserving correspondence between node-link graphs
original url:
https://en.wikipedia.org/wiki/Graph_homomorphism
date created:
2004-05-24T04:44:34Z
date modified:
2024-09-06T02:17:32Z
main entity:
{"identifier":"Q3385162","url":"https://www.wikidata.org/entity/Q3385162"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/aa/Graph_homomorphism_into_C5.svg","width":259,"height":460}
fields total:
13
integrity:
16