asked by
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 

1 Answer

0 like 0 dislike
answered by

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.

Next Question →

Feel free ask your question and help others by answering them.

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

6,998 questions

5,365 answers

70 comments

1,982 users

...