Search Results for ""
11 - 20 of 2230 for Triangular Graph GraphSearch Results
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 hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...
A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...
The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...
A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...
A polyhedral graph on five nodes. There are two topologically distinct pentahedral graphs which, through duality, correspond to the skeletons of the square pyramid (left ...
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 graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...
The equilateral triaugmented triangular prism is the Johnson solid J_(51) constructed by erecting a regular tetrahedron on each square face of an equilateral triangular ...
A graph cycle.
...