nLab
connected graph

Contents

Contents

Idea

An inhabited graph has two notions of being connected:

If a graph’s edges are undirected these two notions coincide while if directed the stronger condition implies the weaker.

For the various categories of graphs, which of their objects are weakly connected correspond to the general notion of connected objects in these categories.

Examples

References

Last revised on January 18, 2018 at 18:22:32. See the history of this page for a list of all contributions to it.