In Graph Theory
In graph theory, a hereditary property is a property of a graph which also holds for (is "inherited" by) its induced subgraphs. Alternately, a hereditary property is preserved by the removal of vertices. A graph class is said hereditary if it is closed under induced subgraphs. Examples of hereditary graph classes are independent graphs (graphs with no edges), which is a special case (with c = 1) of being c-colorable for some number c, being forests, planar, complete, complete multipartite etc.
In some cases, the term "hereditary" has been defined with reference to graph minors, but this is more properly called a minor-hereditary property. The Robertson–Seymour theorem implies that a minor-hereditary property may be characterized in terms of a finite set of forbidden minors.
Read more about this topic: Hereditary Property
Famous quotes containing the words graph and/or theory:
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)
“Lucretius
Sings his great theory of natural origins and of wise conduct; Plato
smiling carves dreams, bright cells
Of incorruptible wax to hive the Greek honey.”
—Robinson Jeffers (1887–1962)