Search Results for ""
41 - 50 of 3128 for Summarize data in a table or graphSearch Results
View search results from all Wolfram sites (214151 matches)The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...
A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...
A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...
A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...
A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...
The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...
A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...
The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...
A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...
The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...
...