具有完美匹配和奇长直径的一类树的RCW数(英文)

胡容维; 赵飚

您当前的位置：

首页 >

文章列表页 >

具有完美匹配和奇长直径的一类树的RCW数(英文)

更新时间：2026-01-21

- 具有完美匹配和奇长直径的一类树的RCW数(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 29, Issue 1, Pages: 53-57(2012)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2012
- 稿件说明：
移动端阅览
[1]胡容维,赵飚.具有完美匹配和奇长直径的一类树的RCW数(英文)[J].新疆大学学报(自然科学版),2012,29(01):53-57.

胡容维, 赵飚. 具有完美匹配和奇长直径的一类树的RCW数(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2012, 29(1): 53-57.
[1]胡容维,赵飚.具有完美匹配和奇长直径的一类树的RCW数(英文)[J].新疆大学学报(自然科学版),2012,29(01):53-57. DOI：

胡容维, 赵飚. 具有完美匹配和奇长直径的一类树的RCW数(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2012, 29(1): 53-57. DOI：

摘要

连通图G的RCW数定义为RCW(G)=Σu

v V(G)1d+1 d(u

v|G)

其中V(G)是图的点集

d(u

v|G)是点u与v之间的距离

d是图G的直径.首先定义了具有完美匹配和奇长直径的一类树

进而确定了这类树的最小

第二小

以及第三小RCW数.

Abstract

The reciprocal complementary Wiener number of a connected graph G is defined as RCW(G) =Σ {u

v} V(G) 1 d+1 d(u

v|G)

where V(G) is the vertex set;d(u

v|G) is the distance between vertices u and v;d is the diameter of G.We firstly give a class of trees with perfect matchings and odd diameter

and we further determine the trees with the smallest

the second smallest and the third smallest reciprocal complementary Wiener numbers.

关键词

Keywords

references

Wiener H.Structural determination of the paraffn boiling points[J].J Amer Chem Soc,1947,69:17-20.

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

Dobrynin A A,Gutman I,Klavzar S,Zigert P.Wiener index of hexagonal systems[J].Acta Appl Math,2002,72:247-294.

Ivanciuc O.QSAR comparative study of Wiener descriptors for weighted molecular graphs[J].J Chem Inf Comput Sci,2000,40:1412-1422.

Ivanciuc O,Ivanciuc T,Balaban A T.The complementary distance matrix,a new molecular graph metric[J].ACH-Models Chem,2000,137:57-82.

Ivanciuc O,Ivanciuc T,Balaban A T.Quantitative structure-property relationship evaluation of structural descriptors derived from the distanceand reverse Wiener matrices[J].Internet Electron J Mol Des,2002,1:467-487.

Ivanciuc O,Ivanciuc T,Balaban A T.Vertex-and edge-weighted molecular graphs and derived structural descriptors,in:J.Devillers,A.T.Balaban(Eds.),Topological Indices and Related Descriptors in QSAR and QSPR[M].Gordon and Breach,The Netherlands,1999,169-220.

Zhou B,Cai X,Trinajstic′N.On reciprocal complementary Wiener number[J].Discrete Appl Math,2009,157:1628-1633.

Cai X,Zhou B.Reciprocal complementary Wiener numbers of trees,unicyclic graphs and bicyclic graphs[J].Discrete Appl Math,2009,157:3046-3054.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

基回数为3的自中心图的构造

Related Author

孟吉翔

Related Institution

No data

⁰