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
Journal ArticleDOI

The distance spectra of Cayley graphs of Coxeter groups

TL;DR: The absolute (respectively, weak) order graph on a Coxeter group is the graph underlying the absolute and weak order poset as mentioned in this paper, and the distance spectra of these graphs are investigated in this paper.
Journal ArticleDOI

Hamiltonicity of the WK-recursive network with and without faulty nodes

TL;DR: This paper first shows that K(d,t) is Hamiltonian-connected, where d/spl ges/4 is the longest linear array between any two distinct nodes with dilation, congestion, load, and expansion all equal to one, and constructs fault-free Hamiltonian cycles in K( d,t), which is optimal.

On the terminal wiener index of thorn graphs

TL;DR: In this article, the terminal Wiener index (TW) of a graph G is equal to the sum of distances between all pairs of pendent vertices of G. This distance-based molecular structure descriptor was put forward quite recently (I. Gutman, B. Furtula, M. Petrovic, J. Math. Chem.
Journal ArticleDOI

Cacti with n-vertices and t cycles having extremal Wiener index

TL;DR: A sharp upper bound on the Wiener index of graphs in Gn,t is established and the corresponding extremal graphs are identified.
Journal ArticleDOI

An adaptive clustering approach for the management of dynamic systems

TL;DR: This work proposes an innovative strategy based on code mobility that dynamically computes near-optimal clusters in linear time and demonstrates the viability of the algorithm based on state-of-the art technologies, and elaborating on its applicability to distributed monitoring, peer-to-peer systems, application-level multicast, and content adaptation networks.