The stacked book graph of order is defined as the graph Cartesian product , where is a star graph and is the path graph on nodes. It is therefore the graph corresponding to the edges of copies of an -page "book" stacked one on top of another and is a generalization of the book graph.

Special cases are summarized in the following table.

Since stacked book graphs are a graph Cartesian product of two unit-distance graphs, the are themselves unit-distance graphs.

Precomputed properties of stacked book graphs are implemented in the Wolfram Language as `GraphData`[`"StackedBook"`, *m*, *n*].