Search Results for ""

Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then the Selberg zeta function is defined as ...

The first and second Zagreb indices for a graph with vertex count n and vertex degrees v_i for i=1, ..., n are defined by Z_1=sum_(i=1)^nv_i^2 and Z_2=sum_((i,j) in ...

q-calculus or quantum calculus is a methodology comparable to the usual study of calculus but which is centered on the idea of deriving q-analogous results without the use of ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

A torispherical dome is the surface obtained from the intersection of a spherical cap with a tangent torus, as illustrated above. The radius of the sphere R is called the ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

The norm of a mathematical object is a quantity that in some (possibly abstract) sense describes the length, size, or extent of the object. Norms exist for complex numbers ...

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...

The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...