Search Results for ""
1131 - 1140 of 2745 for Distance Regular GraphSearch Results
Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...
A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...
A figurate number, also (but mostly in texts from the 1500 and 1600s) known as a figural number (Simpson and Weiner 1992, p. 587), is a number that can be represented by a ...
A number of attractive 10-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A number of attractive 11-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A number of attractive 7-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A hexagrammic prism is a prism formed by two regular hexagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...
A number of attractive 10-compounds of the regular icosahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A number of attractive 11-compounds of the regular icosahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A number of attractive 2-compounds of the regular icosahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...
...
View search results from all Wolfram sites (19754 matches)

