Minimal Path and Acyclic Models in the Path Complex
Abstract
In this paper, firstly, we will study the structure of the path complex (*(G;),∂) of a digraph G via the -generators of *(G,) under strongly regular condition, which is called the minimal path in HY. In particular, we will study various examples of the minimal 3-paths. Secondly, we will show that the supporting sub-digraph of minimal path has acyclic path homologies. Thirdly, we will consider the applications of such an acyclic model.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.