Question: A connected graph is called a tree if it has no circuits. (a) Find the incidence matrix for each of the following directed trees: (i)
(a) Find the incidence matrix for each of the following directed trees:
(i)
-1.png)
(ii)
-2.png)
(iii)
-3.png)
(iv)
(b) Draw all distinct trees with 4 vertices. Assign a direction to the edges, and write down the corresponding incidence matrices.
(c) Prove that a connected graph on n vertices is a tree if and only if it has precisely n - 1 edges.
Step by Step Solution
3.35 Rating (164 Votes )
There are 3 Steps involved in it
a i ii iii iv b c Let m denote the number of edge... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
952-M-L-A-E (1922).docx
120 KBs Word File
