Search Results for ""

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

A generalization of the p-adic norm first proposed by Kürschák in 1913. A valuation |·| on a field K is a function from K to the real numbers R such that the following ...

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

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 ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The Wong graph is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Wong graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 4, and is ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...

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 ...

Discrete Mathematics

An Abelian semigroup is a set whose elements are related by a binary operation (such as addition, rotation, etc.) that is closed, associative, and commutative. A mathematical ...