Search Results for ""

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

A solution to the spherical Bessel differential equation. The two types of solutions are denoted j_n(x) (spherical Bessel function of the first kind) or n_n(x) (spherical ...

A quasi-regular graph is a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 (Bozóki et al. 2020). ...

Given a subset S subset R^n and a real function f which is Gâteaux differentiable at a point x in S, f is said to be pseudoconvex at x if del f(x)·(y-x)>=0,y in ...

The Dirichlet eta function is the function eta(s) defined by eta(s) = sum_(k=1)^(infty)((-1)^(k-1))/(k^s) (1) = (1-2^(1-s))zeta(s), (2) where zeta(s) is the Riemann zeta ...

By analogy with the tanc function, define the tanhc function by tanhc(z)={(tanhz)/z for z!=0; 1 for z=0. (1) It has derivative (dtanhc(z))/(dz)=(sech^2z)/z-(tanhz)/(z^2). (2) ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...

In the Wolfram Language, WignerD[{j, m ,n}, psi, theta, phi] gives the m×n matrix element of a (2j+1)-dimensional unitary representation of SU(2) parametrized by three Euler ...

A kayak paddle graph KP(k,m,l) is the graph obtained by joining cycle graphs C_k and C_m by a path of length l (Gallian 2018). KP(3,3,1) is isomorphic to the 3-barbell graph. ...