Nordhaus-Gaddum relations for proximity and remoteness in graphs

被引：27
|
作者：
Aouchiche, M. [1 ]
Hansen, P.
机构：
[1] Ecole Hautes Etud Commerciales, Gerad, Montreal, PQ, Canada
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2010年 / 59卷 / 08期
关键词：
Nordhaus-Gaddum; Proximity; Remoteness; Extremal graph; VARIABLE NEIGHBORHOOD SEARCH; EXTREMAL GRAPHS; RADIUS;
D O I：
10.1016/j.camwa.2010.02.001
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The transmission of a vertex in a connected graph is the sum of all distances from that vertex to the others. It is said to be normalized if divided by n - 1, where n denotes the order of the graph. The proximity of a graph is the minimum normalized transmission, while the remoteness is the maximum normalized transmission. In this paper, we give Nordhaus-Gaddum-type inequalities for proximity and remoteness in graphs. The extremal graphs are also characterized for each case. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码：2827 / 2835
页数：9
相关论文
共 50 条
12345