Search Results for ""

The mean tangent diameter of a solid, also known as the mean caliper diameter, is the caliper dimension obtained by averaging over all orientations.

The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...

The radius of a graph is the minimum graph eccentricity of any graph vertex in a graph. A disconnected graph therefore has infinite radius (West 2000, p. 71). Graph radius is ...

The term in rigidity theory for the edges of a graph.

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

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...