Search Results for ""
151 - 160 of 337 for planarSearch Results
View search results from all Wolfram sites (1152 matches)The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...
There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten Thomassen. These graphs, illustrated above, are implemented in the Wolfram Language as ...
The triakis icosahedral graph is Archimedean dual graph which is the skeleton of the triakis icosahedron. It is implemented in the Wolfram Language as ...
The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...
The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...
Discrete Mathematics
When the Gaussian curvature K is everywhere negative, a surface is called anticlastic and is saddle-shaped. A surface on which K is everywhere positive is called synclastic. ...
A point p on a regular surface M in R^3 is said to be elliptic if the Gaussian curvature K(p)>0 or equivalently, the principal curvatures kappa_1 and kappa_2 have the same ...
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 ...
The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].
...