Sink (Directed Graph)
A local sink is a node of a Directed Graph with no exiting edges, also called a Terminal (Borowski and Borwein1991, p. 401). A (global) sink is a node in a Directed Graph which is reached by all directed edges (Harary 1994,p. 201).
See also Directed Graph, Network, Source
References
Borowski, E. J. and Borwein, J. M. (Eds.). The HarperCollins Dictionary of Mathematics. New York: HarperCollins, 1991. Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.
- Least Deficient Number
- Least Period
- Least Prime Factor
- Least Squares Fitting
- Least Squares Fitting--Exponential
- Least Squares Fitting--Logarithmic
- Least Squares Fitting--Power Law
- Least Upper Bound
- Lebesgue Constants (Fourier Series)
- Lebesgue Constants (Lagrange Interpolation)
- Lebesgue Covering Dimension
- Lebesgue Dimension
- Lebesgue Integrable
- Lebesgue Integral
- Lebesgue Measurability Problem
- Lebesgue Measure
- Lebesgue Minimal Problem
- Lebesgue-Radon Integral
- Lebesgue Singular Integrals
- Lebesgue-Stieltjes Integral
- Lebesgue Sum
- Le Cam's Identity
- Leech Lattice
- Lefshetz Fixed Point Formula
- Lefshetz's Theorem