TOPICS
Search

Search Results for ""


711 - 720 of 833 for Cohomology ClassSearch Results
The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...
The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...
The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...
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 derivative of a function represents an infinitesimal change in the function with respect to one of its variables. The "simple" derivative of a function f with respect to ...
The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...
A Dirichlet L-series is a series of the form L_k(s,chi)=sum_(n=1)^inftychi_k(n)n^(-s), (1) where the number theoretic character chi_k(n) is an integer function with period k, ...
The ditrigonal icosidodecahedral graph is the skeleton of the cube 5-compound, ditrigonal dodecadodecahedron, great ditrigonalIcosidodecahedron, and small ditrigonal ...
The dodecadodecahedral graph is the skeleton of the dodecadodecahedron, great dodecahemicosahedron, and small dodecahemicosahedron. It is illustrated above in several ...
The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...
1 ... 69|70|71|72|73|74|75 ... 84 Previous Next

...