Good Will

Hunting

Draw all
homeomorphically ,
irreducible trees
of size n= 10 .

•
•

trees networks
of dots & lines
✓
:

but
cycles are banned
00-00
|•
fed ×

① Irreducible
↑
•-•-•
✗ not allowed
f.
.

↑ these are the

¥-•|÷ ÷÷÷
② Homeemorphically : same ✗

③ n = to 10 nodes .

Solution :

•
•
•

/-•→
•

↑
•

•
a.

•
•
.

.•
•

;÷Y÷ .

•-÷_÷ :*i:-&
. : ¥;-¥
••

¥¥¥ 4k¥ .
¥-÷
1. .

÷ -1¥ :

P.TO
 Let be the K
me no .

of vertices with
degree .

1.
nz = 0
by irreducibility
9
for K
2. 0 >
nu =

Thus,

Ni t n} + MY 1- Ms + NG + n7 + n8 + Ma = 10 since n = 10 nodes

and, n = 10 nodes =) n - I = 9 edges

twice
←
count
edges
^ + 3^3 4h4 5ns 6ns 7h7 gang qn 1g
.

+ + + + +
' + =
,

subtracting gives
:

2h } + 3h4 +
4ns +
5h6 + 6h7 t
7ns + 8
ng
= 8

Let r= max { KI na ≠ o } :

÷¥¥
Possible solutions of •

r= 9 :
ng = I = >

r = 8 : 7- ng + 0 = 8 . : impossible

↑ H
r = 7 : Nz = I = > n
} = I =) ↑•]• .

r = 6 : no = I =) My = I = , •-!÷¥÷•
;¥÷!
↓
§]→µ+
:{
= ' n }=2 &

r= 5 3 5 3 3 } ,

from 2)
n
,
= 2 n
,
= 8 = >
•¥%¥ .

•-↓_[%-•
•

↑•-•¥•
↑

{
r = 4 :
my = 2 = > n} = I = >
°

↓ ↓ ↓
. ! !
3 4 4-
4 3 4
,
n, , , imp , , , , , ,

↑
r= 3 : n 4 >
↑ ↑→ ↑ ↑
t•-q-q•→
= =
}

q_•y
or

o f.
q←•
•

to