A tree of a network graph consists of (A) (n-1) nodes (B) n branches (C) one or two nodes left in isolated position (D) no closed paths 
asked in Network Analysis by

1 Answer

0 like 0 dislike

imageThe dual of a tree is sometimes called a maze Itconsists of spaces connected by links in the same way that the tree consists of nodes connected by treebranches. Duals cannot be formed for every graph. ... Consequently, only planar graphs have duals.

answered by

Related questions

How it works: Anybody can ask a question and anybody can answer it.

6,998 questions
5,305 answers
64 comments
1,743 users