The Smallest Hosoya Index of Bicyclic Graphs with Given Pendent Vertices  

作　　者：Lihua YOU Chaoxia WEI Zhifu YOU 

机构地区：[1]School of Mathematical Sciences, South China Normal University [2]School of Computer Science, Guangdong Polytechnic Normal University

出　　处：《Journal of Mathematical Research with Applications》2014年第1期12-32,共21页数学研究及应用（英文版）

基　　金：Supported by National Natural Science Foundation of China (Grant No.11301093);the Zhujiang Technology New Star Foundation of Guangzhou (Grant No.2011J2200090);Program on International Cooperation and Innovation,Department of Education,Guangdong Province (Grant No.2012gjhz0007)

摘　　要：Let G be a graph. The Hosoya index Z（G） of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent vertices. Finally, we present a new proof about the smallest Hosoya index of bicyclic graphs.Let G be a graph. The Hosoya index Z（G） of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent vertices. Finally, we present a new proof about the smallest Hosoya index of bicyclic graphs.

关 键 词：Hosoya index bicyclic graph pendent vertex matching. 

分 类 号：O157.5[理学—数学] TS934.3[理学—基础数学]