Search Results for ""

The shortest path-spanning tree from a graph vertex of a graph.

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

A point traced out twice as a closed curve is traversed. The maximum number of double points for a nondegenerate quartic curve is three. An ordinary double point is also ...

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

There are a few plane curves known as "bean curves." The bean curve identified by Cundy and Rowllet (1989, p. 72) is the quartic curve given by the implicit equation ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

The Kummer surfaces are a family of quartic surfaces given by the algebraic equation (x^2+y^2+z^2-mu^2w^2)^2-lambdapqrs=0, (1) where lambda=(3mu^2-1)/(3-mu^2), (2) p, q, r, ...

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.