摘要
以z(G)表示图G的Hosoya指数,m(G,k)表示G的k-匹配数,则z(G)表示所有m(G,k)的总和。研究了直径不超过4的树的Hosoya指数,刻画了取得极值时的极图。
After experiment,m(G,k) be the k-matching of graph G and z(G) be the Hosoya index of the graph G.Then z(G) is the total number of m(G,k).We shall investigate the Hosoya index of trees with diameter not more than 4,and characterize its extreme graphs.
出处
《湖南工业大学学报》
2007年第6期23-25,共3页
Journal of Hunan University of Technology