中文

仙人掌图的最大度阻力距离

组合数学 2016-04-19 v2

摘要

各种基于图顶点间距离的拓扑指数在理论化学中广泛应用。图GG的度阻力距离定义为DR(G)={u,v}V(G)[d(u)+d(v)]R(u,v),{D_R}(G) = \sum\limits_{\{u,v\} \subseteq V(G)} {[d(u) + d(v)]R(u,v)},其中d(u)d(u)是顶点uu的度,R(u,v)R(u, v)是顶点uuvv间的阻力距离。若图GG的每个块均为边或圈,则称GG为仙人掌图。本文完全刻画了在所有具有nn个顶点和tt个圈的顶点仙人掌图中具有最大度阻力距离的极值仙人掌图,并推广了近期一篇论文[J. Tu, J. Du, G. Su, The unicyclic graphs with maximum degree resistance distance, Appl. Math. Comput. 268 (2015) 859-864]的某些结果。

关键词

引用

@article{arxiv.1511.04704,
  title  = {The maximum degree resistance distance of cacti},
  author = {Jia-Bao Liu and Xiang-Feng Pan},
  journal= {arXiv preprint arXiv:1511.04704},
  year   = {2016}
}

备注

This paper has been withdrawn by the author due to some errors