首页> 外文会议>Federated Conference on Computer Science and Information Systems >On the generalized Wiener polarity index for some classes of graphs
【24h】

On the generalized Wiener polarity index for some classes of graphs

机译:关于某些图的广义维纳极性指数

获取原文

摘要

The generalized Wiener polarity index W{ink}(G) of a graph G = (V, E) is defined as a number of unordered pairs {u, v} of G such that the shortest distance between u and v is equal to k: W(G) = |{{u, v}, d(u, v) = k, u, v ∈ V (G)}| In this paper we give some results for 2-trees in case of mentioned index. We present an infinite family of 2-trees with maximum value of generalized Wiener polarity index.
机译:将图G =(V,E)的广义维纳极性指数W {ink}(G)定义为G的无序对{u,v}的数量,以使u和v之间的最短距离等于k :W(G)= | {{u,v},d(u,v)= k,u,v∈V(G)} |在本文中,我们给出了在提到索引的情况下2树的一些结果。我们提出了一个无限的2树族,其中广义维纳极性指数为最大值。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号