Search Results for ""
131 - 140 of 2283 for Triangular Grid GraphSearch Results
View search results from all Wolfram sites (17976 matches)Johnson solid J_7.
Johnson solid J_(44).
A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...
An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...
A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).
The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...
The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...
There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...
The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].
The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...
...