TOPICS
Search

Search Results for ""


61 - 70 of 772 for binary starSearch Results
Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...
Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...
A regular polygram {n/k} is generalization of a (regular) polygon on n sides (i.e., an n-gon) obtained by connecting every ith vertex around a circle with every (i+k)th, ...
A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...
The Sombor spectral radius rho_(Sombor) of a graph is defined as the largest eigenvalue of the Sombor matrix. Liu et al. (2022) shows that for any tree, ...
A uniform-density polyhedral solid is unistable (also called monostable) if it is stable on exactly one face (Croft et al. 1991, p. 61). For example, the 19-faced polyhedron ...
Let X=(X,tau) be a topological vector space whose continuous dual X^* may or may not separate points (i.e., may or may not be T2). The weak-* (pronounced "weak star") ...
The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...
The join G=G_1+G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph union G_1 union G_2 together with all the edges joining ...
Pogson's ratio is the constant 100^(1/5)=10^(2/5)=2.511886431... (OEIS A189824) appearing in the definition of the astronomical magnitude (brightness) scale. This scale is ...
1 ... 4|5|6|7|8|9|10 ... 78 Previous Next

...