Search Results for ""
91 - 100 of 2012 for Polyhedral graphSearch Results
View search results from all Wolfram sites (12667 matches)The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...
A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...
The pentagonal wedge graph is the skeleton of the pentagonal wedge. It is a has 8 vertices, 12 edges, and 6 faces. The pentagonal wedge graph is implemented in the Wolfram ...
A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...
The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...
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 great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...
A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...
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 ...
An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.
...