检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Department of Mathematics,Hechi University,Yizhou 546300,China
出 处:《Applied Mathematics(A Journal of Chinese Universities)》2012年第3期305-319,共15页高校应用数学学报(英文版)(B辑)
基 金:Supported by the National Natural Science Foundation of China(10761008);the Scientific Research Foundation of the Education Department of Guangxi Province of China(201010LX471,201010LX495,201106LX595,201106LX608);the Natural Science Fund of Hechi University(2011YBZ-N003,2012YBZ-N004)
摘 要:The Hosoya index of a graph is defined as the total number of the matching of the graph. In this paper, the ordering of polygonal chains with respect to Hosoya index is characterized.The Hosoya index of a graph is defined as the total number of the matching of the graph. In this paper, the ordering of polygonal chains with respect to Hosoya index is characterized.
关 键 词:Hosoya index MATCHING polygonal chain
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术] O152.7[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.19