Search Results for ""
211 - 220 of 4141 for Non Line Graphs_ 800Search Results
The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...
The cyclic group C_9 is one of the two Abelian groups of group order 9 (the other order-9 Abelian group being C_3×C_3; there are no non-Abelian groups of order 9). An example ...
The group C_2×C_2×C_2 is one of the three Abelian groups of order 8 (the other two groups are non-Abelian). An example is the modulo multiplication group M_(24) (which is the ...
C_2×C_4 is one of the three Abelian groups of group order 8 (the other two being non-Abelian). Examples include the modulo multiplication groups M_(15), M_(16), M_(20), and ...
The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...
The gem graph is the fan graph F_(4,1) illustrated above. It is implemented in the Wolfram Language as GraphData["GemGraph"].
An l_x table is a tabulation of numbers which is used to calculate life expectancies. x n_x d_x l_x q_x L_x T_x e_x 0 1000 200 1.00 0.20 0.90 2.70 2.70 1 800 100 0.80 0.12 ...
"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...
The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...
The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...
...
View search results from all Wolfram sites (39200 matches)

