Search Results for ""

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

The Laplacian spectral ratio R_L(G) of a connected graph G is defined as the ratio of its Laplacian spectral radius to its algebraic connectivity. If a connected graph of ...

A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...

The largest known prime numbers are Mersenne primes, the largest of these known as of September 2013 bing 2^(57885161)-1, which has a whopping 17425170 decimal digits. As of ...

A submodule L of a module M such that for any other nonzero submodule K of M, the intersection L intersection K is not the zero module. L is also called an essential ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

The statistical index P_L=(sump_nq_0)/(sump_0q_0), where p_n is the price per unit in period n and q_0 is the quantity produced in the initial period.

An irregular dodecagonal cross in the shape of a dagger |. The six faces of a cube can be cut along seven edges and unfolded into a Latin cross (i.e., the Latin cross is the ...

A k×n Latin rectangle is a k×n matrix with elements a_(ij) in {1,2,...,n} such that entries in each row and column are distinct. If k=n, the special case of a Latin square ...