NIST

degree

(definition)

Definition: (1) Of a vertex, the number of edges connected to it. (2) Of a graph, the maximum degree of any vertex. (3) Of a tree node, the number of child nodes it has.

See also in-degree, out-degree.

Note: From Algorithms and Theory of Computation Handbook, page 6-21, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.

Author: CRC-A


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 8 February 2006.
HTML page formatted Fri Mar 25 16:20:34 2011.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "degree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 8 February 2006. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/degree.html

to NIST home page