In mathematics, a fibration of graphs, or graph fibration, is a homomorphism of directed graphs that satisfies a unique lifting property analogous to that of a fibration in topology. Intuitively, the target (base) graph is "covered" by the source (total) graph in such a way that each arc of the base can be uniquely lifted to any node in the fibre of its target.
In mathematics, a fibration of graphs, or graph fibration, is a homomorphism of directed graphs that satisfies a unique lifting property analogous to that of a fibration in topology. Intuitively, the target (base) graph is "covered" by the source (total) graph in such a way that each arc of the base can be uniquely lifted to any node in the fibre of its target.
Source: Wikipedia "Fibrations of graphs" · CC BY-SA 4.0
Share this article: X · Bluesky