QQ客服 官方微博 反馈留言

	Some upper bounds for the atom-bond connectivity index of graphs*
	Chen, Jinsong ; Liu, Jianping ; Guo, Xiaofeng ; Guo XF(郭晓峰)
	2012-07
关键词	Atom-bond connectivity index Vertex connectivity Matching number
英文摘要	The recently introduced 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. Furtula et al. determined the extremal ABC values for chemical trees, and showed that the star tree S-n has the maximal ABC index among all trees. In this work, we show that among all n-vertex graphs with vertex connectivity k, the graph K-k boolean OR (K-1 boolean OR Kn- k-1) is the unique graph with maximum ABC index. Furthermore, we determine the maximum ABC index of a connected graph with n vertices and matching number beta and characterize the unique extremal graph as K (beta) root Kn-beta. (C) 2012 Elsevier Ltd. All rights reserved.; NSFC [11071272, 11171279, 11101087]; Foundation of the Educational Committee of Fujian [JA10021]
语种	英语
出版者	PERGAMON-ELSEVIER SCIENCE LTD
内容类型	期刊论文
源URL	[http://dx.doi.org/10.1016/j.aml.2012.03.021]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Chen, Jinsong,Liu, Jianping,Guo, Xiaofeng,et al. Some upper bounds for the atom-bond connectivity index of graphs*[J],2012.
APA	Chen, Jinsong,Liu, Jianping,Guo, Xiaofeng,&郭晓峰.(2012).Some upper bounds for the atom-bond connectivity index of graphs*..
MLA	Chen, Jinsong,et al."Some upper bounds for the atom-bond connectivity index of graphs*".(2012).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。