Search Results for ""

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

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

The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].

The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

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.

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

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. ...

The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.