Pn表示n个顶点的路,在Pn的每个顶点上都悬挂m条边所得到的图称为Vn(m)图,也称为Vertebrated图,Vn(m)图是一类Gutman树.给出了Vn(m)图的Hosoya指数和Merrifield指数的递推关系及其值,这些结论可用于研究链状六角系统的完美匹配数.
Let P, denote the path with n vertices. The graphs V(m), io e. Vertebrated graphs, can be obtained by attaching m edges at each vertex of P.. Vertebrated graphs belong to the Gutman trees. The Hosoya index and Merrifield index of V(nm) graphs are characterized in this paper,and the relative results are useful foe the enumeration of perfect matchings for Hexagonal chains.