Web Graph


Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) 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 Y_(m,n)=C_m square P_n itself, where C_m is a cycle graph, P_n is a path graph, and  square denotes a graph Cartesian product.

The bipartite double graph of the web graph W_n for n odd is W_(2n).

See also

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

Explore with Wolfram|Alpha


Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018., 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 Web Resource.

Subject classifications