Search Results for ""
131 - 140 of 3128 for Summarize data in a table or graphSearch Results
View search results from all Wolfram sites (214151 matches)A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...
Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...
The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...
The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. 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 ...
A cubic semisymmetric graph is a graph that is both cubic (i.e., regular of degree 3) and semisymmetric (i.e., edge- but not vertex-transitive). The four smallest cubic ...
The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...
The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...
A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...
A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...
...