Degree (graph Theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree of a vertex is denoted The maximum degree of a graph G, denoted by Δ(G), and the minimum degree of a graph, denoted by δ(G), are the maximum and minimum degree of its vertices. In the graph on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, all degrees are the same, and so we can speak of the degree of the graph.
Read more about Degree (graph Theory): Handshaking Lemma, Degree Sequence, Special Values, Global Properties
Famous quotes containing the word degree:
“Need I explain to the inhabitants of England, for whom I chiefly write, how extreme are those sufferings, and how great the costliness of that old age which is unable in any degree to supply its own wants? Such old age should not, we Britannulists maintain, be allowed to be.”
—Anthony Trollope (1815–1882)