Mapping fiber, loop and suspension graphs in naive discrete homotopy theory

Abstract

Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the (non-)similarities between the A-homotopy and ordinary homotopy theories through explicit constructions. More precisely, we define mapping fiber graphs and study their basic properties yielding, under a technical condition, a discrete analogous of Puppe sequence in a naive discrete homotopy theory.