Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Neither Wikipedia nor mathworld gave the answer: What is the name of the edge (or multiple edges) without which a DAG would be a tree? Or maybe instead: What is the name of the subgraph such that there are two (or more) distinct directed paths from one node to another node?

Here's the context: I'm rewriting documentation that describes two different sets of rules for the edges of a graph: one set applies when you're talking about edges that form a tree, the other, that form a DAG but not a tree. The documentation currently refers to these as "acyclic edges" and "cyclic edges" but that isn't right ...

share|improve this question
    
These correspond to what would be cycles if you interpreted your DAG as an undirected graph. So possibly something related to the phrase undirected cycle? –  Rahul Jul 15 at 3:40

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.