Let $G_1,\ldots,G_m$ be a sequence of graphs, all having the same number $n$ of vertices. For each pair $(G_i, G_{i+1})$ we add $n$ edges that connect the vertices of $G_i$ and $G_{i+1}$ bijectively. My question: Is there an established name for this "stack" of graphs?
Ali Taghavi
- 356
- 8
- 31
- 123