𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalized representation of the “rectilinear diameter” rule

✍ Scribed by N. K. Bolotin; A. M. Shelomentsev; M. Yu. Tyutyunnikov

Publisher
Springer US
Year
1975
Tongue
English
Weight
144 KB
Volume
11
Category
Article
ISSN
0009-3092

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The generalized diameter of a graph
The generalized diameter of a graph
✍ Chih-Kang Eric Chen; R. S. Garfinkel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract We generalize the concept of the diameter of a graph __G__ = (__N, A__) to allow for location of points not on the nodes. It is shown that there exists a finite set of candidate points which determine this __generalized diameter.__ Given the matrix of shortest paths, an __o__ (|__A__|^2

The generalized S-graphs of diameter 3
The generalized S-graphs of diameter 3
✍ Jixiang Meng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 459 KB

A graph is called a generalized S-graph if for every vertex v of G there exists exactly one vertex which is more remote from v than every vertex adjacent to v. A generalized S-graph of diameter 3 is called reducible if there is a pair of diametrical vertices v and t~ such that G-{u, ~} is also a gen