๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graphs with specified radius and diameter

โœ Scribed by Phillip A. Ostrand

Book ID
107748155
Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
408 KB
Volume
4
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Generalized eccentricity, radius, and di
Generalized eccentricity, radius, and diameter in graphs
โœ Dankelmann, Peter; Goddard, Wayne; Henning, Michael A.; Swart, Henda C. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 101 KB ๐Ÿ‘ 1 views

For a vertex v and a (k ฯช 1)-element subset P of vertices of a graph, one can define the distance from v to P in various ways, including the minimum, average, and maximum distance from v to P. Associated with each of these distances, one can define the k-eccentricity of the vertex v as the maximum d

Minimum graphs of specified diameter, co
Minimum graphs of specified diameter, connectivity and valence. II
โœ E. Engelhardt; V. Klee; K. Li; H. Quaife ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 769 KB

In order to avoid trivialities, it is assumed throughout that d 22, vacal, and ~23. A (d, c, v)-graph is a c-connected graph of diameter d in which each node is of valence v. The minimum order (number of nodes) of such graphs is denoted by p(d, c, v), and a minimum (d, c, v)-graph is one of minimum