Search Results for ""
1131 - 1140 of 2275 for Interval_graphSearch Results
The equilateral triaugmented triangular prism is the Johnson solid J_(51) constructed by erecting a regular tetrahedron on each square face of an equilateral triangular ...
A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...
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 ...
Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...
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 method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...
...
View search results from all Wolfram sites (19078 matches)

