首页> 外文期刊>International Journal of Quantum Chemistry >Resistance Distance in Regular Graphs
【24h】

Resistance Distance in Regular Graphs

机译:正则图中的电阻距离

获取原文
获取原文并翻译 | 示例
       

摘要

This report considers the resistance distance as a recently proposed new intrinsic metric on(molecular) graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been proved that R(G_N) > R(K_N), where G_N denotes a connected graph containing N vertices and K_N denotes a complete graph containing N vertices. The formulas to obtain the R for two classes of regular graphs (cycles and complete graphs) are derived. numerical values of R for four Platonic molecules are also given. They ordered the considered Platonic solids as the icosahedron, the cube, the octahedron, and the tetrahedron according to complexity of their Schlegel graphs. This order agrees with those obtained by many other, frequently used descriptors.
机译:该报告将电阻距离视为(分子)图上最近提出的新的内在度量,特别是所有对顶点之间的电阻距离上的总和R被视为图不变。已经证明R(G_N)> R(K_N),其中G_N表示包含N个顶点的连通图,K_N表示包含N个顶点的完整图。得出用于获得两类规则图(循环图和完整图)的R的公式。还给出了四个柏拉图分子的R的数值。他们根据其Schlegel图的复杂性,将考虑的柏拉图固体定为二十面体,立方体,八面体和四面体。此顺序与许多其他常用描述符获得的顺序一致。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号