A Mongolian tent graph is defined as the graph obtained from the grid graph for odd 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 -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*].