首页 | 本学科首页   官方微博 | 高级检索  
     检索      

A SOLUTION TO ONE OF KANO'S CONJECTURES CONCERNING k-th MAXIMAL SPANNING TREES
作者姓名:刘振宏
作者单位:Institute of
摘    要:Let (G) be the collection of all spanning trees of a connected and weighted graph G,and F_1, F_2,…,F_m the partition of (G) such that F_i is the set of i-th maximal spanning trees of G.Kano conjectured that for any A∈F_1 and every integer k,1≤k≤m,there exists T∈F_k such that|T/A| k—l.This paper gives the conjecture a very simple proof,and related results.

本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号