  We observe two kinds of fractal approximating graphs, the background
structures of the generalized Sierpinski Arrowhead Curve independently of the
recursive curves. Both graphs related to the generalized Sierpinski Gasket and
based on a checked triangular generator pattern. In the Overall Graph we
connect the corners of the up facing neighbouring dark tiles. In the Inscribed
Graph we connect their centroids. We describe their cardinalities in general
case with recursive and explicit formulas, the numbers of their vertices and
edges, their edge covering Hamiltonian-paths and -cycles, and their
tiling-paths and -cycles which cover all of their dark tiles. Some of these
formations are unambiguously transformable into each other and these bijective
pairs keep their basic properties after the transformation. Some of their
cardinalities form new integer sequences.
