Degree (graph Theory) - Special Values

Special Values

  • A vertex with degree 0 is called an isolated vertex.
  • A vertex with degree 1 is called a leaf vertex or end vertex, and the edge incident with that vertex is called a pendant edge. In the graph on the right, {3,5} is a pendant edge. This terminology is common in the study of trees in graph theory and especially trees as data structures.
  • A vertex with degree n-1 in a graph on n vertices is called a dominating vertex.

Read more about this topic:  Degree (graph Theory)

Famous quotes containing the words special and/or values:

    The line that I am urging as today’s conventional wisdom is not a denial of consciousness. It is often called, with more reason, a repudiation of mind. It is indeed a repudiation of mind as a second substance, over and above body. It can be described less harshly as an identification of mind with some of the faculties, states, and activities of the body. Mental states and events are a special subclass of the states and events of the human or animal body.
    Willard Van Orman Quine (b. 1908)

    Nothing is so threatening to conventional values as a man who does not want to work or does not want to work at a challenging job, and most people are disturbed if a man in a well- paying job indicates ambivalence or dislike toward it.
    Alice S. Rossi (b. 1922)