TOPICS
Search

Mongolian Tent Graph


MongolianTentGraph

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex of the top row to the additional vertex (Lee 1985; Gallian 2011, p. 14).

The (2,3)-Mongolian tent graph is isomorphic to the 3-gear graph.

Mongolian tent graphs are graceful (Lee 1985, Gallian 2018). Mongolian tent graphs are also unit-distance.

A Mongolian village is defined as a graph formed by successively amalgamating copies of Mongolian tents with the same number of rows so that adjacent tents share a column (Gallian 2018).

Precomputed properties of Mongolian tent graphs are implemented in the Wolfram Language as GraphData[{"MongolianTent", {m, n}}].


See also

Gear Graph, Grid Graph, House Graph

Explore with Wolfram|Alpha

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.Lee, S. M. "k-Graceful Labelling of Mongolian Tents and Related Graphs." Congr. Numer. 50, 85-96, 1985.

Referenced on Wolfram|Alpha

Mongolian Tent Graph

Cite this as:

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

Subject classifications