ausblenden:
Schlagwörter:
-
Zusammenfassung:
We generalize Biggs Theorem to the case of directed cycles of multi-digraphs allowing to compute the dimension of the directed cycle space independently of the graph representation with linear runtime complexity. By considering two-dimensional CW complex of elementary cycles and deriving formulas for the Betti numbers of the associated cellular homology groups, we extend the list of representation independent topological inavariants measuring the graph structure. We prove the computation of the 2nd Betti number to be sharp #Phard in general and present specific representation invariant sub-fillings yielding efficiently computable homology groups. Finally, we suggest howto use the provided structural measures to shed new light on graph theoretical problems as graph embeddings, discrete Morse theoryand graph clustering.
