Search Results for ""
1201 - 1210 of 1998 for Queen's graphSearch Results
A class of subvarieties of the Grassmannian G(n,m,K). Given m integers 1<=a_1<...<a_m<=n, the Schubert variety Omega(a_1,...,a_m) is the set of points of G(n,m,K) ...
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 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 ...
Cards are a set of n rectangular pieces of cardboard with markings on one side and a uniform pattern on the other. The collection of all cards is called a "deck," and a ...
Mathematics is a broad-ranging field of study in which the properties and interactions of idealized objects are examined. Whereas mathematics began merely as a calculational ...
A generalization of calculus of variations which draws the relationship between the stationary points of a smooth real-valued function on a manifold and the global topology ...
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 ...
A matching is a maximum matching iff it contains no augmenting path.
...
View search results from all Wolfram sites (12613 matches)

