Search Results for ""
1581 - 1590 of 2823 for Unit_distance_graphSearch Results
In general, an icosidodecahedron is a 32-faced polyhedron. A number of such solids are illustrated above. "The" (quasiregular) icosidodecahedron is the 32-faced Archimedean ...
Tracing through the connections of a branchial graph gives rise to the notion of a kind of space in which states on different branches of history are laid out. In particular, ...
The pentakis icosidodecahedron is the dual of the chamfered dodecahedron. It contains 42 vertices, 120 edges, and 80 faces. The canonical version has two distinct edge ...
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...
A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...
The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...
A cube 9-compound can be constructed from the vertices of the first dodecahedron 2-compound. It will be implemented in a future version of the Wolfram Language as ...
A Pareto plot is type of plot used in quality control applications that combines a bar chart displaying percentages of categories in the data with a line graph showing ...
A quantity defined for a conic section which can be given in terms of semimajor a and semiminor axes b. interval curve e e=0 circle 0 0<e<1 ellipse sqrt(1-(b^2)/(a^2)) e=1 ...
...
View search results from all Wolfram sites (22301 matches)

