Electrical and Electronics Engineering Discussion Forum
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 by

1 Answer

0 votes

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
← Prev Question Next Question →
7,802 questions
6,402 answers
2,321 users