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 
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.

by

Related questions

1 answer
0 answers
asked Dec 24, 2018 by RAJANA NARENDRA | 76 views
1 answer
0 answers
1 answer
0 answers
0 answers
0 answers

9,138 questions

7,898 answers

145 comments

3,242 users