Triangular Snake Graph


The triangular snake graph TS_n is the graph on n vertices with n odd defined by starting with the path graph P_(n-1) and adding edges (2i-1,2i+1) for i=1, ..., n-1. The first few are illustrated above, and special cases are summarized in the following table.

Triangular snakes are unit-distance and matchstick by construction, perfect. They are graceful when the number of triangles is congruent to 0 or 1 (mod 4) (Moulton 1989, Gallian 2018), which is equivalent to when n=1,3 (mod 8). Triangular snakes are also geodetic.

See also

Butterfly Graph, Path Graph, Polyiamond, Triangle Graph

Explore with Wolfram|Alpha


Clancy, K.; Haythorpe, M.; and Newcombe, A. §4.5.1 in "A Survey of Graphs with Known or Bounded Crossing Numbers." 15 Feb 2019, pp. 58-59., J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018., D. "Graceful Labelings of Triangular Snakes." Ars Combin. 28, 3-13, 1989.Rajan, B.; Rajasingh. I.; and Vasanthi Beulah, P. "Crossing Number of Join of Triangular Snake with mK_1." Path and Cycle. Int. J. Comp. Appl. 44, 20-22, 2012.

Cite this as:

Weisstein, Eric W. "Triangular Snake Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications