Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Qufu Normal University(Natural Science)》 2013-01
Add to Favorite Get Latest Update

Large Trees with m-matchings and Smaller Hosoya Index

CHEN Lai-huan,ZHAO Biao(Institute of Mathematics and System Sciences,Xinjiang University,830046,Urumqi,Xinjiang,PRC)  
For a graph G,its Hosoya index is defined by the total number of independent edge sets of G.Until now,it is found the first and second minimal to the fifth minimal Hosoya index for the m-matching tree.Hou(2002) has found the m-matching with minimal Hosoya index in the article of on acyclic systems with minimal Hosoya index.For the third to fifth minimal Hosoya index,Ye(2006,2008) has found in the articles of trees with m-matchings and the third minimal Hosoya index and trees with m-matchings and the fourth and fifth minimal Hosoya index,respectively.In this article,we will give a smaller Hosoya index.
【CateGory Index】: O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved