Search Results for ""

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.

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...

A dozen dozen, also called a gross. 144 is a square number and a sum-product number.

The intersection product for classes of rational equivalence between cycles on an algebraic variety.

The geometry of the Lie group R semidirect product with R^2, where R acts on R^2 by (t,(x,y))->(e^tx,e^(-t)y).

A bundle or fiber bundle is trivial if it is isomorphic to the cross product of the base space and a fiber.