Search Results for ""

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The cuboctahedral graph is an Archimedean quartic symmetric graph on 12 nodes and 24 edges that is the skeleton of the cuboctahedron, as well as the uniform ...

The doubly truncated Witt graph is the graph on 330 vertices related to a 3-(22,8,12) design (Brouwer et al. 1989, p. 367). The doubly truncated Witt graph can be constructed ...

The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...

The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...

An (ordinary) torus is a surface having genus one, and therefore possessing a single "hole" (left figure). The single-holed "ring" torus is known in older literature as an ...

The pathological function f_a(x)=sum_(k=1)^infty(sin(pik^ax))/(pik^a) (originally defined for a=2) that is continuous but differentiable only on a set of points of measure ...

A generalization of the Lebesgue integral. A measurable function f(x) is called A-integrable over the closed interval [a,b] if m{x:|f(x)|>n}=O(n^(-1)), (1) where m is the ...

The ABC (atom-bond connectivity) index of a graph is defined as half the sum of the matrix elements of its ABC matrix. It was introduced by Estrada et al. (2017) to model the ...