Search Results for ""
651 - 660 of 2124 for Archimedean graphSearch Results
A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.
The great rhombicuboctahedron (Cundy and Rowlett 1989, p. 106) is the 26-faced Archimedean solid consisting of faces 12{4}+8{6}+6{8}. It is sometimes called the ...
In general, an icosidodecahedron is a 32-faced polyhedron. A number of such solids are illustrated above. "The" (quasiregular) icosidodecahedron is the 32-faced Archimedean ...
A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.
An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...
An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...
A polyhedron or plane tessellation is called semiregular if its faces are all regular polygons and its corners are alike (Walsh 1972; Coxeter 1973, pp. 4 and 58; Holden 1991, ...
The cuboctahedron, also called the heptaparallelohedron or dymaxion (the latter according to Buckminster Fuller; Rawles 1997), is the Archimedean solid with faces 8{3}+6{4}. ...
A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).
Graph Strength
...