检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:CHEN Jin-song GUO Xiao-feng
机构地区:[1]College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, China. [2]College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, China. [3]School of Mathematical Sciences, Xiamen University, Xiamen 361005, China.
出 处:《Applied Mathematics(A Journal of Chinese Universities)》2012年第2期243-252,共10页高校应用数学学报(英文版)(B辑)
基 金:Supported by the National Natural Science Foundation of China(11071272,10831001,11171279,11101087);the Young Talent Foundation of Fuzhou University(XRC-1154)
摘 要:The atom-bond connectivity(ABC) index provides a good model for the stability of linear and branched alkanes as well as the strain energy of cycloalkanes,which is defined as ABC(G) =∑ uv∈E(G) √d u+dv-2 dudv,where du denotes the degree of a vertex u in G.A chemical graph is a graph in which no vertex has degree greater than 4.In this paper,we obtain the sharp upper and lower bounds on ABC index of chemical bicyclic graphs.The atom-bond connectivity(ABC) index provides a good model for the stability of linear and branched alkanes as well as the strain energy of cycloalkanes,which is defined as ABC(G) =∑ uv∈E(G) √d u+dv-2 dudv,where du denotes the degree of a vertex u in G.A chemical graph is a graph in which no vertex has degree greater than 4.In this paper,we obtain the sharp upper and lower bounds on ABC index of chemical bicyclic graphs.
关 键 词:atom-bond connectivity index chemical bicyclic graph bound.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229