TOPICS
Search

Search Results for ""


1281 - 1290 of 2124 for Archimedean_graphSearch Results
LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...
The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...
A quasiregular polyhedron is the solid region interior to two dual regular polyhedra with Schläfli symbols {p,q} and {q,p}. Quasiregular polyhedra are denoted using a ...
Johnson solid J_(90).
Quantifies deviation from translational invariance by describing the distribution of gaps within a set at multiple scales. The more lacunar a set, the more heterogeneous the ...
A basis of a modular system M is any set of polynomials B_1, B_2, ... of M such that every polynomial of M is expressible in the form R_1B_1+R_2B_2+..., where R_1, R_2, ... ...
A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...
B. Chilton and R. Whorf have studied stellations of the triakis tetrahedron (Wenninger 1983, p. 36). Whorf has found 138 stellations, 44 of which are fully symmetric and 94 ...
The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.
The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...
1 ... 126|127|128|129|130|131|132 ... 213 Previous Next

...