Search Results for ""

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

A simple graph with n>=3 graph vertices in which each graph vertex has vertex degree >=n/2 has a Hamiltonian cycle.

The regular skew icosahedron is a six-dimensional regular polytope that is just as symmetric as the Platonic icosahedron, but having different angles (Coxeter 1950; Coxeter ...

Of all convex n-gons of a given perimeter, the one which maximizes area is the regular n-gon.

An automorphism which interchanges the two vertices of a regular map at each edge without interchanging the vertices.

Let M be an oriented regular surface in R^3 with normal N. Then the support function of M is the function h:M->R defined by h(p)=p·N(p).

X fulfils the T1-separation axiom and is regular. A space satisfying the T_3-separation axiom is said to be a T3-space.

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...