BETA
Examples ofpseudoforest
Dictionary> Examples ofpseudoforest
pseudoforestisn’t in the Cambridge Dictionary yet. You can help!
Add a definition
A directedpseudoforestis a directed graph in which each vertex has at most one outgoing edge; that is, it has outdegree at most one.
From
This example is from Wikipedia and may be reused under a CC BY-SA license.
Wikipedia
This example is from Wikipedia and may be reused under a CC BY-SA license.Apseudoforestis an undirected graph in which each connected component contains at most one cycle.
FromThis example is from Wikipedia and may be reused under a CC BY-SA license.
Wikipedia
This example is from Wikipedia and may be reused under a CC BY-SA license.Alternatively, omitting the self-loops produces a non-maximalpseudoforest.
FromThis example is from Wikipedia and may be reused under a CC BY-SA license.
Wikipedia
This example is from Wikipedia and may be reused under a CC BY-SA license.Almost every sufficiently sparse random graph ispseudoforest.
FromThis example is from Wikipedia and may be reused under a CC BY-SA license.
Wikipedia
This example is from Wikipedia and may be reused under a CC BY-SA license.Thus, a graph is apseudoforestif and only if it does not have the butterfly or the diamond as a minor.
FromThis example is from Wikipedia and may be reused under a CC BY-SA license.
Wikipedia
This example is from Wikipedia and may be reused under a CC BY-SA license.A pseudotree is a connectedpseudoforest.
FromThis example is from Wikipedia and may be reused under a CC BY-SA license.
Wikipedia
This example is from Wikipedia and may be reused under a CC BY-SA license.These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors.