Search Results for ""

The triangular grid graph T_n is the lattice graph obtained by interpreting the order-(n+1) triangular grid as a graph, with the intersection of grid lines being the vertices ...

A triangular grid, also called an isometric grid (Gardner 1986, pp. 209-210), is a grid formed by tiling the plane regularly with equilateral triangles.

A k×m×n hexagonal grid graph is a graph of adjoined hexagons consisting of k hexagons along the horizontal triangular axis, m along the northeast axis, and n along the ...

A grid usually refers to two or more infinite sets of evenly-spaced parallel lines at particular angles to each other in a plane, or the intersections of such lines. The two ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

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

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...

A square grid is a grid formed by tiling the plane regularly with squares.