Search Results for ""

"The" square graphs is the cycle graph C_4. It is isomorphic to the complete bipartite graph K_(2,2). Like all cycle graphs, the line graph of C_4 is isomorphic to itself. A ...

The cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated cube. It is implemented in the Wolfram Language as ...

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

The Danzer graph is the Levi graph of the Danzer configuration (Boben et al. 2015). It has 70 vertices and 140 edges and is quartic, bipartite, self-dual, and unit-distance. ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...

Elementary methods consist of arithmetic, geometry, and high school algebra. These are the only tools that may be used in the branch of number theory known as elementary ...

A likelihood function L(a) is the probability or probability density for the occurrence of a sample configuration x_1, ..., x_n given that the probability density f(x;a) with ...

The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...