The Wiener index of the kth power of a graph

被引：21

作者：

An, Xinhui ^{[1
]}

Wu, Baoyindureng ^{[1
]}

机构：

[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China

来源：

APPLIED MATHEMATICS LETTERS | 2008年 / 21卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Wiener index; kth power of a graph; complement; distance; diameter;

D O I：

10.1016/j.aml.2007.03.025

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The kth power of a graph G, denoted by G(k), is a graph with the same vertex set as G Such that two vertices are adjacent in G(k) if and only if their distance is at most k in G. The Wiener index is a distance-based topological index defined as the sum of distances between all pairs of vertices in a graph. In this note, we give the bounds on the Wiener index of the graph Gk The Nordhaus-Gaddum-type inequality for the Wiener index of the graph G(k) is also presented. (C) 2007 Elsevier Ltd. All rights reserved.

引用

页码：436 / 440

页数：5

共 6 条

[1]

Bondy J.A., 2008, GRAD TEXTS MATH

[2] Wiener index of trees: Theory and applications [J].

Dobrynin, AA ;

Entringer, R ;

Gutman, I .

ACTA APPLICANDAE MATHEMATICAE, 2001, 66 (03) :211-249

[3]

ENTRINGER RC, 1976, CZECH MATH J, V26, P283

[4]

Nordhaus E.A., 1956, Amer. Math. Monthly, V63, P175, DOI [DOI 10.2307/2306658, 10.2307/2306658]

[5] STRUCTURAL DETERMINATION OF PARAFFIN BOILING POINTS [J].

WIENER, H .

JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1947, 69 (01) :17-20

[6]

Zhang L, 2005, MATCH-COMMUN MATH CO, V54, P189

← 1 →