Abstract: In the paper, a counterexample of the Graffiti’s conjecture (583) is given out whichproves the conjecture is false. And the best bounds of I(T) +a’(T) are got, where Tdenotes a free, I(T) denotes the inverse degree of T and a’(T) is the matching of T.

Key words: tree, edge-independence number, inverse degree