树和单圈图的点Co-PI指标的界（英文）

康成俊; 吐然尼古丽·艾散; 依明江·沙比尔; 艾尔肯·吾买尔

doi:10.13568/j.cnki.651094.2015.02.010

您当前的位置：

首页 >

文章列表页 >

树和单圈图的点Co-PI指标的界（英文）

数理科学 | 更新时间：2026-01-21

- 树和单圈图的点Co-PI指标的界（英文）
- 树和单圈图的点Co-PI指标的界（英文）
- 新疆大学学报（自然科学版中英文） 2015年32卷第2期页码：183-189
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
  
  Supported by NSFC(No.11361060,No.11061034)
- DOI：10.13568/j.cnki.651094.2015.02.010
  中图分类号： O157.5
- 纸质出版：2015
- 稿件说明：
移动端阅览
[1]康成俊,吐然尼古丽·艾散,依明江·沙比尔,等.树和单圈图的点Co-PI指标的界（英文）[J].新疆大学学报(自然科学版),2015,32(02):183-189+194.
[1]康成俊,吐然尼古丽·艾散,依明江·沙比尔,等.树和单圈图的点Co-PI指标的界（英文）[J].新疆大学学报(自然科学版),2015,32(02):183-189+194. DOI： 10.13568/j.cnki.651094.2015.02.010.

DOI：10.13568/j.cnki.651094.2015.02.010.

摘要

令G=(V

E)是一个连通图.对于边e=uv∈E(G)

令nu(e)为距u的距离比距v的距离近的点的个数

nv(e)为距v的距离比距u的距离近的点的个数.图G的点Co-PI指标定义为Co-PIv(G)=e=uv∈E(G)|nu(e)-nv(e)|.在本文中

得到了树和单圈图的点Co-PI指标的上下界

并且给出了单圈图的点Co-PI指标的第二、第三、第四小和第二大值.

Abstract

LetG =(V

E) be a connected graph.For e = uv ∈ E(G)

let nu(e) be the number of vertices closer to u than to v

nv(e) be the number of vertices closer to v than to u.The vertex Co-PI index of G is defined as Co-PIv(G) =|nu(e)-e=uv∈E(G)nv(e)|. In this paper

sharp upper and lower bounds on the vertex Co-PI index of trees and unicycilc graphs are reported.Moreover

the second

third

fourth minimum and the second maximum values of this index for unicyclic graphs are given.

关键词

Keywords

references

Khadikar P V.On a Novel Structural Descriptor PI[J].Nat Acad Sci Lett,2000,113-118.

Yousefi-Azari H,Ashrafi A R,Khalifeh M H.Computing vertex-PI index of single and multi-walled nanotubes[J].Dig J Nanomat Bios,2008,3:315-318.

Hasani F,Khormali O,Iranmanesh A.Computation of the first vertex of co-PI index of TUC4CS(S)nanotubes[J].Optoelectron Adv Mater Rapid Commun,2010,4:544-547.

Su G,Xiong L,Xu L.On the Co-PI and Laplacian Co-PI eigenvalues of a graph[J].Discr Appl Math,2013,161:277-283.

Dobrynin A,Entrnger R,Gutman I.Wiener index of trees:theory and applications[J].Acta Appl Math,2001,66:211-249.

Gutman I,Dobrynin A.The Szeged index-a succrss story[J].Graph Theory Notes NY,1998,34:37-44.

Das K C,Gutman I.Estimating the Szeged index[J].Appl Math Lett,2009,22:1680-1684.

Klavzar S,Rajapakse A,Gutman I.The Szeged and the Wiener index of graphs[J].Appl Math Lett,1996,9:45-49.

Khadikar P V,Kale P P,Deshpande N V,Karmarkar S and Agrawal V K.Novel PI indices of hexagonal chains[J].J Math Chem,2001,29:143-150.

Khadikar P V,Karmarkar S,Agrawal V K.A novel PI index and its applications to QSPR/QSAR studies[J].J Chem Inf Comput Sci,2001,41:934-949.

Khadikar P V,Karmarkar S,Varma R G.On the estimation of PI index of polyacenes[J].Acta Chim Slov,2002,49:755-771.

Hoji M,Luo Z,Vumar E.Wiener and vertex PI indices of Kronecker products of graph[J].Discrete Appl Math,2010,158:1845-1855.

Ashrafi A R,Loghman A.PI index of zig-zag polyhex nanotubes[J].MATCH Commun Math Comput Chem,2006,55(2):447-452.

Li S,Bian H,Wang G,Yu H.Vertex PI indices of some sums of graphs[J].Ars Combin,2011,98.

Li S,Wang G.Vertex PI indices of four sums of graphs[J].Discrete Appi Math,2011,159:1601-1607.

You L,Zhu R,You Z.The(weighted)vertex PI index of unicyclic graphs[J].MATCH Commun Math Comput Chem,2012,67(2):383-404.

Khalifeh M H,Yousefi-Azari H,Ashrafi A R.Vertex and edge PI indices of Cartesian product graphs[J].Discrete Appl Math,2008,156:1780-1789.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

单圈图和双圈图的连续边着色(英文)

关于树的补图的色多项式

乘法型兰州指标关于树，单圈图和双圈图的极值（英文）