Web Graph
Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph 
with the edges of the outer cycle removed.
Web graphs are graceful.
Precomputed properties of web graphs are available in the Wolfram Language as GraphData[![<span style=]()
{" src="https://mathworld.wolfram.com/images/equations/WebGraph/Inline2.svg" style="height:22px; width:6px" />"Web", n![<span style=]()
}" src="https://mathworld.wolfram.com/images/equations/WebGraph/Inline3.svg" style="height:22px; width:6px" />].
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 
.
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.Horvat, B. and Pisanski, T. "Products of Unit Distance Graphs." Disc. Math. 310, 1783-1792, 2010.
Koh, K. M.; Rogers, D. G.; Teo, H. K.; and Yap, K. Y. "Graceful Graphs: Some Further Results and Problems." Congr. Numer. 29, 559-571, 1980.
