Download Wolfram Notebook

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 2026).

Web graphs in the convention used here are graceful (Gallian 2026).

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 .

See also

Crossed Prism Graph, Cycle Graph, Helm Graph, Ladder Graph, Möbius Ladder, Stacked Prism Graph, Wheel Graph

Explore with Wolfram|Alpha

References

Gallian, J. A. §§2.2 and 2.8 in "A Dynamic Survey of Graph Labeling." Elec. J. Combin., Dynamic Survey DS6, Nov. 6, 2026. https://doi.org/10.37236/27.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.

Referenced on Wolfram|Alpha

Web Graph

Cite this as:

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

Subject classifications