TOPICS
Search

Search Results for ""


501 - 510 of 880 for Weakly Connected DigraphSearch Results
The Schläfli double sixes graph is the Levi graph of the double sixes configuration.
If two similar figures lie in the plane but do not have parallel sides (i.e., they are similar but not homothetic), there exists a center of similitude, also called a ...
The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...
The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...
The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...
The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...
There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...
Let L(x) denote the Rogers L-function defined in terms of the usual dilogarithm by L(x) = 6/(pi^2)[Li_2(x)+1/2lnxln(1-x)] (1) = ...
Affine functions represent vector-valued functions of the form f(x_1,...,x_n)=A_1x_1+...+A_nx_n+b. The coefficients can be scalars or dense or sparse matrices. The constant ...
Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...
1 ... 48|49|50|51|52|53|54 ... 88 Previous Next

...