Search Results for "Coordinate Geometry"
9171 - 9180 of 13135 for Coordinate GeometrySearch Results

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 ...
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 lattice automorphism is a lattice endomorphism that is also a lattice isomorphism.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice endomorphism is a mapping h:L->L that preserves both meets and joins.
A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice isomorphism is a one-to-one and onto lattice homomorphism.
A path composed of connected horizontal and vertical line segments, each passing between adjacent lattice points. A lattice path is therefore a sequence of points P_0, P_1, ...
Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a polarity of L if and only if f is a decreasing join-endomorphism and g is an increasing ...
Lattice theory is the study of sets of objects known as lattices. It is an outgrowth of the study of Boolean algebras, and provides a framework for unifying the study of ...
