scispace - formally typeset
Open AccessBook

Distance in graphs

Fred Buckley, +1 more
About
The article was published on 1990-01-01 and is currently open access. It has received 1185 citations till now. The article focuses on the topics: Graph theory & Convexity.

read more

Citations
More filters
Proceedings ArticleDOI

Fast Distributed Computation of Distances in Networks

TL;DR: This paper presents a distributed algorithm to simultaneously compute the diameter, radius and node eccentricity in all nodes of a synchronous network and shows local criteria for detecting convergence in each node.
Journal ArticleDOI

The Wiener index of the kth power of a graph

TL;DR: The Nordhaus–Gaddum-type inequality for the Wiener index of the graph G k is presented and the bounds on theWiener index are given.
Journal ArticleDOI

Minimum statuses of connected graphs with fixed maximum degree and order

TL;DR: The sharp lower bound and the sharp upper bound on the minimum status of a connected graph with maximum degree k and order n are obtained.
Journal ArticleDOI

Generalized Wiener indices in hexagonal chains

TL;DR: The generalized Wiener index for catacondensed benzenoid hydrocarbons was studied in this article, where the authors deduce a similar relationship between these three indices for graph formed of concatenated hexagons, or hexagonal chains.
Journal ArticleDOI

The hyper-Wiener index of the generalized hierarchical product of graphs

TL;DR: The hyper-Wiener index of the generalized hierarchical product of two graphs is computed and some applications of this operation are given.