Search Results for ""

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...

The Robertson graph is the unique (4,5)-cage graph, illustrated above. It has 19 vertices and 38 edges. It has girth 5, diameter 3, chromatic number 3, and is a quartic ...

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

"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 Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

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

The asymptotic form of the n-step Bernoulli distribution with parameters p and q=1-p is given by P_n(k) = (n; k)p^kq^(n-k) (1) ∼ 1/(sqrt(2pinpq))e^(-(k-np)^2/(2npq)) (2) ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...