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:
“When I tried to talk to my father about the kind of work I might do after college, he said, “You know, Charlotte, I’ve been giving a lot of thought to that, and it seems to me that the world really needs good, competent secretaries. Your English degree will help you.” He said this with perfect seriousness. I was an A student at Bryn Mawr ...”
—Charlotte Palmer (b. c. 1925)