Adjacency Matrix
The adjacency matrix of a simple Graph is a Matrix with rows and columns labeled byVertices, with a 1 or 0 in position 
according to whether 
and 
areAdjacent or not.
References
Chartrand, G. Introductory Graph Theory. New York: Dover, p. 218, 1985.
- Landen's Formula
- Landen's Transformation
- Lane-Emden Differential Equation
- Langford's Problem
- Langlands Program
- Langlands Reciprocity
- Langton's Ant
- Laplace-Beltrami Operator
- Laplace Distribution
- Laplace Limit
- Laplace-Mehler Integral
- Laplace's Equation
- Laplace's Equation--Bipolar Coordinates
- Laplace's Equation--Bispherical Coordinates
- Laplace's Equation--Toroidal Coordinates
- Laplace Series
- Laplace's Integral
- Laplace-Stieltjes Transform
- Laplace Transform
- Laplacian
- Laplacian Determinant Expansion by Minors
- Large Number
- Large Prime
- Laspeyres' Index
- Latin Cross