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:

    A special kind of beauty exists which is born in language, of language, and for language.
    Gaston Bachelard (1884–1962)

    Our first line of defense in raising children with values is modeling good behavior ourselves. This is critical. How will our kids learn tolerance for others if our hearts are filled with hate? Learn compassion if we are indifferent? Perceive academics as important if soccer practice is a higher priority than homework?
    Fred G. Gosman (20th century)