Search Results for ""

A complete metric space is a metric space in which every Cauchy sequence is convergent. Examples include the real numbers with the usual metric, the complex numbers, ...

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

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

A graph G is hypohamiltonian if G is nonhamiltonian, but G-v is Hamiltonian for every v in V (Bondy and Murty 1976, p. 61). The Petersen graph, which has ten nodes, is the ...

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

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

A surface which is simultaneously complete and minimal. There have been a large number of fundamental breakthroughs in the study of such surfaces in recent years, and they ...

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...