Graph Immersions, Inverse Monoids, and Deck Transformations
Group Theory
2019-04-12 v2
Abstract
If is a covering map between connected graphs, and is the subgroup of used to construct the cover, then it is well known that the group of deck transformations of the cover is isomorphic to , where is the normalizer of in . We show that an entirely analogous result holds for immersions between connected graphs, where the subgroup is replaced by the closed inverse submonoid of the inverse monoid used to construct the immersion. We observe a relationship between group actions on graphs and deck transformations of graph immersions. We also show that a graph immersion may be extended to a cover in such a way that all deck transformations of are restrictions of deck transformations of .
Cite
@article{arxiv.1903.07203,
title = {Graph Immersions, Inverse Monoids, and Deck Transformations},
author = {Corbin Groothuis and John Meakin},
journal= {arXiv preprint arXiv:1903.07203},
year = {2019}
}
Comments
19 pages, 3 figures