Topics: Tree - Graph Theory
(definition)
A rooted tree is a directed tree where there exists exactly one vertex whose internal degree is , and the internal degrees of the other vertices is exactly .
Search
Topics: Tree - Graph Theory
(definition)
A rooted tree is a directed tree where there exists exactly one vertex whose internal degree is 0, and the internal degrees of the other vertices is exactly 1.