Search Results for ""

"Neighborhood" is a word with many different levels of meaning in mathematics. One of the most general concepts of a neighborhood of a point x in R^n (also called an ...

The zeros of the derivative P^'(z) of a polynomial P(z) that are not multiple zeros of P(z) are the positions of equilibrium in the field of force due to unit particles ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

A univariate distribution proportional to the F-distribution. If the vector d is Gaussian multivariate-distributed with zero mean and unit covariance matrix N_p(0,I) and M is ...

The Paulus graphs are the 15 strongly regular graphs on 25 nodes with parameters (nu,k,lambda,mu)=(25,12,5,6) and the 10 strongly regular graphs on 26 nodes with parameters ...

Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. The ...

A diagonal matrix D=diag(d_1,...,d_n) sometimes also called the valency matrix corresponding to a graph that has the vertex degree of d_i in the ith position (Skiena 1990, p. ...

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).