Fundamental Groupoids for Graphs

In recent years several notions of discrete homotopy for graphs have been introduced, including a notion of ×-homotopy due to Dochtermann. In this paper, we define a ×-homotopy fundamental groupoid for graphs, and prove that it is a functorial ×-homotopy invariant for finite graphs. We also introduc...

Full description

Bibliographic Details
Main Authors: Tien Chih, Laura Scull
Format: Article
Language:English
Published: Shahid Beheshti University 2022-01-01
Series:Categories and General Algebraic Structures with Applications
Subjects:
Online Access:https://cgasa.sbu.ac.ir/article_101766_3bc1a1701be553da8327d97fc712a071.pdf
Description
Summary:In recent years several notions of discrete homotopy for graphs have been introduced, including a notion of ×-homotopy due to Dochtermann. In this paper, we define a ×-homotopy fundamental groupoid for graphs, and prove that it is a functorial ×-homotopy invariant for finite graphs. We also introduce tools to compute this fundamental groupoid, including a van Kampen theorem. We conclude with a comparison with previous definitions along these lines, including those built on polyhedral complexes of graph morphisms.
ISSN:2345-5853
2345-5861