#
nLab

dagger-graph

# Contents

## Idea

A *$\dagger$-graph* is a directed graph equipped for each pair of vertices $x,y$ with an involution $\sigma_{x,y} : V(x,y) \to V(y,x)$.

This is one way to think of *undirected* graphs.

The notion of $\dagger$-graph is to that of dagger-category as the notion of directed graph is to the ordinary notion of category.

## References

???

Last revised on July 9, 2010 at 23:06:13.
See the history of this page for a list of all contributions to it.