Prove that a tree with a vertex of degree 3 must have at least 3 leaves.

answer:

it is general formula that is used to write value to its excet position

a11 a12 a13

a21 a22 a23

it is the example of order 2 by 3 matrix in this

a11 means value occur in 1 st row 1st column

a12 means value occurs in 1st row 2nd column

a13 means value occur in 1st row and 3rd column

a21 means value occurs in 2nd row and 1st column

a22 means value occurs in 2nd row and in 2nd column

a23 means value occurs in 2nd row and in 3rd column

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)

2

step-by-step explanation: