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[
"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 
.
