关于Graffiti的一个猜想(583)*
On One of Graffiti’s Conjecture(583)
-
摘要: 本文给出了Graffiti的猜想(583)[1]的一个反倒,说明猜想不真.并且得到了I(T)+a'(T)的较好的上下界.T表示树;a'(T)表示树T的边独立数:I(T)表示树T的反比度.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
-
[1] F.R.K.Chung,The average distance and the independence number,J of Graph Theory,12(1988),229～235. [2] I.A.Bondy and U.S.R.Murty,Graph Theory with Applications,The MacMillan Press Ltd.(1976). -
点击查看大图
计量
- 文章访问数: 1499
- HTML全文浏览量: 59
- PDF下载量: 502
- 被引次数: 0
下载:
