首页> 外文会议>International Conference and Workshops on Basic and Applied Sciences >Restricted Detour Polynomial of Edge- Identification of Two Wheel Graphs
【24h】

Restricted Detour Polynomial of Edge- Identification of Two Wheel Graphs

机译:限制边缘的绕道多项式 - 两个车轮图的识别

获取原文

摘要

The restricted detour distance D*(u, v) between two vertices u and v of G is the length of a longest u - v path P in G such that = P. The restricted detour polynomial of the graph G is denoted by D*(G;x) and defined as D*(G; x)=∑ u,_v x~(D*)(u,v) . The restricted detour index dd*(G) of a connected graph G is the Wiener index with respect to restricted detour distance, that is dd*(G)=∑u,vD*(u, v) . In this paper, the restricted detour polynomial and restricted detour index of edge identification of two wheel graphs are obtained.
机译:两个顶点U和G之间的受限制的弯曲距离D *(U,V)是G中最长U-V路径P的长度,使得 = P.该图的受限制的弯曲多项式g由d *(g; x)表示,并定义为d *(g; x)=σu,_v x〜(d *)(u,v)。连接图G的受限制的弯曲索引DD *(g)是关于受限制的绕行距离的维纳索引,即DD *(g)=ΣU,VD *(U,V)。在本文中,获得了两个车轮图的边缘识别边缘识别的受限制的迂回多项式和限制迂回指数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号