Graphs of morphisms of graphs
The electronic journal of combinatorics, Tome 15 (2008)
This is an account for the combinatorially minded reader of various categories of directed and undirected graphs, and their analogies with the category of sets. As an application, the endomorphisms of a graph are in this context not only composable, giving a monoid structure, but also have a notion of adjacency, so that the set of endomorphisms is both a monoid and a graph. We extend Shrimpton's (unpublished) investigations on the morphism digraphs of reflexive digraphs to the undirected case by using an equivalence between a category of reflexive, undirected graphs and the category of reflexive, directed graphs with reversal. In so doing, we emphasise a picture of the elements of an undirected graph, as involving two types of edges with a single vertex, namely 'bands' and 'loops'. Such edges are distinguished by the behaviour of morphisms with respect to these elements.
DOI :
10.37236/919
Classification :
18B99, 05C25, 18A40, 18D15
Mots-clés : graph, digraph, Cartesian closed category, topos
Mots-clés : graph, digraph, Cartesian closed category, topos
@article{10_37236_919,
author = {R. Brown and I. Morris and J. Shrimpton and C. D. Wensley},
title = {Graphs of morphisms of graphs},
journal = {The electronic journal of combinatorics},
year = {2008},
volume = {15},
doi = {10.37236/919},
zbl = {1187.18002},
url = {http://geodesic.mathdoc.fr/articles/10.37236/919/}
}
R. Brown; I. Morris; J. Shrimpton; C. D. Wensley. Graphs of morphisms of graphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/919
Cité par Sources :