TOPICS
Search

Search Results for ""


1051 - 1060 of 1683 for graphsSearch Results
The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...
The group of functions from an object G to itself which preserve the structure of the object, denoted Aut(G). The automorphism group of a group preserves the multiplication ...
The Császár polyhedron is a polyhedron that is topologically equivalent to a torus which was discovered in the late 1940s by Ákos Császár (Gardner 1975). It has 7 polyhedron ...
The Danzer configuration is a 35_4 self-dual configuration of 35 lines and 35 points in which 4 points lie on each line and 4 lines pass through each point. The Levi graph of ...
An embedding is a representation of a topological object, manifold, graph, field, etc. in a certain space in such a way that its connectivity or algebraic properties are ...
In geometry, an endpoint is one of the two points at the boundary of a line segment. In analysis, an endpoint is one of the two points at the boundary of a closed interval or ...
Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...
The term "God's number" is sometimes given to the graph diameter of Rubik's graph, which is the minimum number of turns required to solve a Rubik's cube from an arbitrary ...
An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...
A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...
1 ... 103|104|105|106|107|108|109 ... 169 Previous Next

...