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

Constructing vertex-disjoint paths in (n, k)-star graphs

TL;DR: This work describes a novel routing algorithm for constructing a container of width n-1 between a pair of vertices in an (n, k)-star graph with connectivity n- 1.
Journal ArticleDOI

Distance spectrum of graph compositions

TL;DR: In this article, the D -spectrum of the cartesian product of two distance regular graphs was obtained. But the distance spectrum of the lexicographic product of the two graphs G and H when H is regular is not known.
Journal ArticleDOI

Comparison between Kirchhoff index and the Laplacian-energy-like invariant

TL;DR: In this article, the Kirchhoff index and the Laplacian energy-like invariant of a connected graph of order n were defined, and sufficient conditions under which LEL > Kf holds.
Journal ArticleDOI

Upper bounds on the average eccentricity

TL;DR: Sharp upper bounds on the average eccentricity of a connected graph of given order in terms of its independence number, chromatic number, domination number or connected domination number are given.

On the Harary Energy and Harary Estrada Index of a Graph

TL;DR: The main purposes of as discussed by the authors are to introduce and investigate the Harary energy and Harary Estrada index of a graph and establish upper and lower bounds for these new energy and index separately.