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:

    He’s leaving Germany by special request of the Nazi government. First he sends a dispatch about Danzig and how 10,000 German tourists are pouring into the city every day with butterfly nets in their hands and submachine guns in their knapsacks. They warn him right then. What does he do next? Goes to a reception at von Ribbentropf’s and keeps yelling for gefilte fish!
    Billy Wilder (b. 1906)

    If the Russians have gone too far in subjecting the child and his peer group to conformity to a single set of values imposed by the adult society, perhaps we have reached the point of diminishing returns in allowing excessive autonomy and in failing to utilize the constructive potential of the peer group in developing social responsibility and consideration for others.
    Urie Bronfenbrenner (b. 1917)