Search Results for ""
1061 - 1070 of 2745 for Distance Regular GraphSearch Results
In a graph G, contraction of an edge e with endpoints u,v is the replacement of u and v with a single vertex such that edges incident to the new vertex are the edges other ...
A planar embedding, also called a "plane graph" (Harary 1994, p. 103; Harborth and Möller 1994), "planar drawing," or "plane drawing," of a planar graph is an embedding in ...
If x is a regular patch on a regular surface in R^3 with normal N^^, then x_(uu) = Gamma_(11)^1x_u+Gamma_(11)^2x_v+eN^^ (1) x_(uv) = Gamma_(12)^1x_u+Gamma_(12)^2x_v+fN^^ (2) ...
A 20-sided polygon. The regular icosagon is a constructible polygon, and the regular icosagon of unit side length has inradius r, circumradius R, and area A given by r = ...
Am octagonal prims is a prism composed of octagonal faces. The regular right octagonal prism of unit edge length has surface area and volume S = 4(3+sqrt(2)) (1) V = ...
A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...
The graph corresponding to the complete k-ary tree on n nodes is implemented in the Wolfram Language as KaryTree[n, k].
The term "Aristotle gap"' is introduced in this work to refer to the angle between the first and last member of a 5-tetrahedral ring. This gap has angle measure theta = ...
A chamfered dodecahedron, inaccurately called a truncated rhombic triacontahedron or more accurately called a pentatruncated rhombic triacontahedron, is a polyhedron obtained ...
A chamfered octahedron, which could also know known as a tritruncated rhombic dodecahedron, is a polyhedron obtained by chamfering a regular octahedron. The illustration ...
...
View search results from all Wolfram sites (19754 matches)

