Search Results for ""

The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

Through any point in the plane, there is at most one straight line parallel to a given straight line. This axiom is equivalent to the parallel postulate.

The upper horizontal line segment in the above figure appears to be longer than the lower line segment despite the fact that both are the same length.