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:
“Take but degree away, untune that string,
And hark what discord follows!
...
Force should be right, or, rather, right and wrong—
Between whose endless jar justice resides—
Should lose their names, and so should justice too.
Then everything includes itself in power,
Power into will, will into appetite;
And appetite, an universal wolf,
So doubly seconded with will and power,
Must make perforce an universal prey,
And last eat up himself.”
—William Shakespeare (1564–1616)