Search Results for ""
571 - 580 of 1812 for Cayley graphsSearch Results
View search results from all Wolfram sites (7392 matches)A bicubic nonhamiltonian graph is a bicubic (i.e., bipartite cubic graph) that is nonhamiltonian (i.e., that does not possess a Hamiltonian cycle). Tutte (1971) conjectured ...
The graph corresponding to the complete k-ary tree on n nodes is implemented in the Wolfram Language as KaryTree[n, k].
The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).
The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).
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 ...
A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...
A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...
The sequence of graphs starting with the Suzuki graph and successively taking local graphs, summarized in the following table, is known as the Suzuki tower, a name due to ...
The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...
The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.
...