TOPICS
Search

Search Results for ""


1501 - 1510 of 2745 for Distance Regular GraphSearch Results
The slant height of an object (such as a frustum, or pyramid) is the distance measured along a lateral face from the base to the apex along the "center" of the face. In other ...
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 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 simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...
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 ...
1 ... 148|149|150|151|152|153|154 ... 275 Previous Next

...