TOPICS
Search

Search Results for ""


1201 - 1210 of 1423 for Small Great Circles_ 700Search Results
The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...
The Nevanlinna Prize is awarded by the International Mathematical Union to outstanding contributors to the mathematical aspects of information science. The International ...
Dickson states "In a letter to Tanner [L'intermediaire des math., 2, 1895, 317] Lucas stated that Mersenne (1644, 1647) implied that a necessary and sufficient condition that ...
A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...
A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...
The parachute graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["ParachuteGraph"].
The parapluie (French for 'umbrella') graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["ParapluieGraph"].
The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...
The Pierce expansion, or alternated Egyptian product, of a real number 0<x<1 is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...
A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...
1 ... 118|119|120|121|122|123|124 ... 143 Previous Next

...