2. 您的位置
3. 首页
4. 会议论文
5. Some structural properties of the tree with minimal ABC index

Some structural properties of the tree with minimal ABC index

来源 :The 12th Meeting of the International Academy of Mathematica | 被引量 : 0次 | 上传用户：fangrong87

【摘 要】

：

　　The atom-bond connectivity index(also called ABC index for short)of a graph G is defined as(ABC(G)=Σij∈E(G)√di+dj-2/didj),where E(G)is the edge set of G,

【作 者】

：

Darko Dimitrov Zhibin Du Carlos M.da Fonseca 

【机 构】

：

Hochschulef(u)rTechnikundWirtschaftBerlinWilhelminenhofstra(β)e75A,D-12459Berlin,GermanySchoolofMath

【出 处】

：

The 12th Meeting of the International Academy of Mathematica

【发表日期】

：

2016年7期

下载到本地 , 更方便阅读

下载此文 赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　The atom-bond connectivity index(also called ABC index for short)of a graph G is defined as(ABC(G)=Σij∈E(G)√di+dj-2/didj),where E(G)is the edge set of G,and di is the degree of vertex i in G.The ABC index of graphs has been receiving a lot of attentions these years.

其他文献

多翻转角标定磁共振成像射频磁场不均匀性的方法

会议

超高场人体非质子成像磁共振控制系统的研制

会议

二胺氧化酶触发的超极化129XeOff-On分子探针

会议

石墨烯MnO2空心磁性纳米球复合探针用于肺癌靶向诊疗

会议

Some results on forcing numbers of graphs

　　In this talk,we present our results on forcing numbers of graphs and some recent developments in forcing numbers of graphs.

会议

Mathematical structural descriptorsDevelopment and applications to diverse areas including drug desi

　　Applications of discrete mathematics in the development of structural descriptors began in the middle of the twentieth century and the trend is continuingev

会议

量子秘钥分发研究进展

会议

Extremal properties on the nullity of graphs

　　The nullity of a graph is the multiplicity of the eigenvalue zero of its adjacency matrix.The nullity of graphs has not only the mathematical meaning but al

会议

Some results on the Harary index of graphs

　　In this talk.I will present some results on the Minimal Haray index of graphs with several parameters.Also.I will report some recent results on the relation

会议

On borderenergetic graphs

　　A graph G is called borderenergetic if its energy ε(G)is equal to the energy of the complete graph of the same order n,i.e.,ε(G)= 2(n-1).This talk will su

会议