TOPICS
Search

Stacked Book Graph


StackedBookGraph

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is therefore the graph corresponding to the edges of n copies of an m-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}}].


See also

Book Graph, Domino Graph, Graph Cartesian Product, Grid Graph, Ladder Graph, Square Graph, Star Graph, Unit-Distance Graph

Explore with Wolfram|Alpha

References

Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018. https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6.

Referenced on Wolfram|Alpha

Stacked Book Graph

Cite this as:

Weisstein, Eric W. "Stacked Book Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/StackedBookGraph.html

Subject classifications