Search Results for ""
1961 - 1970 of 13135 for Regular numberSearch Results
View search results from all Wolfram sites (51777 matches)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 ...
Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...
The doubly truncated Witt graph is the graph on 330 vertices related to a 3-(22,8,12) design (Brouwer et al. 1989, p. 367). The doubly truncated Witt graph can be constructed ...
The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...
The Johnson graph J(n,k) has vertices given by the k-subsets of {1,...,n}, with two vertices connected iff their intersection has size k-1. Special classes are summarized in ...
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 ...
The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...
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 cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated dodecahedron. 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 ...
...