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 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.
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.