The term web graph is used in this work for the graph obtained from the stacked prism graph 
, for 
, by removing the edges
of its outer cycle.
Koh et al. (1980) use a related construction with a central graph vertex. They join the pendant vertices of a helm graph to form a cycle graph and then add a pendant edge at each graph vertex of that outer cycle graph (Gallian 2025, p. 15).
Web graphs in the convention used here are graceful (Gallian 2025, p. 24).
Precomputed properties of web graphs are available in the Wolfram Language as GraphData[
"Web", n
].
The term "web graph" is also used (e.g., Horvat and Pisanski 2010) to refer to the stacked prism graph 
itself, where 
is a cycle graph, 
is a path graph, and 
denotes a graph
Cartesian product.
The bipartite double graph of the web graph 
for 
odd is 
.
