期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
ON ONE OF GRAFFITI'S CONJECTURE (583)
1
作者 王流星 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1997年第4期381-383,共3页
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 d... 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. 展开更多
关键词 TREE edge-independence number inverse degree
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部