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
Book ChapterDOI

Navigating the World Wide Web

TL;DR: This presentation explains how search engines partially solve the problem of locating relevant documents and finding “good” starting points for navigation, but more navigational assistance is needed to guide users through and between Weh sites.
Journal ArticleDOI

Geodesic visibility in graphs

TL;DR: The visibility relations defined by arc and node pebblings are incomparable, and general characterizations of the visibility relations that can be defined by the two types of pebBLings are given.
Journal ArticleDOI

On the monophonic number of a graph

TL;DR: In this article, the minimum cardinality of a monophonic set of a connected graph G = (V,E) of order at least two is defined, denoted by m(G).
Journal ArticleDOI

System synthesis with morphological clique problem: fusion of subsystem evaluation decisions

TL;DR: This article examines hierarchical (tree-like) models for composite systems and considers the following: traditional multi-criteria evaluation approaches; morphological clique problem with special discrete spaces for evaluation of system excellence; and generalization of morphologicalClique problem.
Journal ArticleDOI

On the distance spectral radius and the distance energy of graphs

TL;DR: In this article, the authors obtained a lower bound for the largest D-eigenvalue of a connected graph and an upper bound for E D (G) which improved Indulal's bounds.