Welcome to electrical and electronics engineering discussion website, Please login or register to continue.

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 

Your answer

Thanks for your contribution. Feel free to answer this question. Please avoid short answer. Your answer is most welcome. Be genuine.

Upload image or document:

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
Are you a robot ? (Y = Yes / N = No)
To avoid this verification in future, please log in or register.

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.

Welcome to Q&A site for electrical and electronics engineering discussion for diploma, B.E./B.Tech, M.E./M.Tech, & PhD study.
If you have a new question please ask in English.
If you want to help this community answer these questions.