TOPICS
Search

Search Results for ""


1261 - 1270 of 2138 for Complement graphSearch Results
The inner Napoleon circle, a term coined here for the first time, is the circumcircle of the inner Napoleon triangle. It has center at the triangle centroid G (and is thus ...
The outer Napoleon circle, a term coined here for the first time, is the circumcircle of the outer Napoleon triangle. It has center at the triangle centroid G (and is thus ...
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 ...
The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.
The Tits group is a group of order 17971200. It is implemented in the Wolfram Language as TitsGroupT[].
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.
The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...
1 ... 124|125|126|127|128|129|130 ... 214 Previous Next

...