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

On uniformly geodetic graphs

โœ Scribed by J. H. Koolen


Publisher
Springer Japan
Year
1993
Tongue
English
Weight
432 KB
Volume
9
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A new infinite series of regular uniform
โœ A.E. Brouwer; J.H. Koolen ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 481 KB

We construct vertex-transitive graphs r, regular of valency k = n\* + n + 1 on Y =2(y) vertices, with integral spectrum, possessing a distinguished complete matching such that contracting the edges of this matching yields the Johnson graph J(2n, n) (of valency n'). These graphs are uniformly geodeti

On F-geodetic graphs
โœ Raffaele Scapellato ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 868 KB

We study the graphs in which the number of geodesics between any two vertices depends only on their distance. We consider also a connection between some of these graphs and geodetic graphs.

Geodetic contraction games on graphs
โœ A. S. Fraenkel; F. Harary ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 530 KB
Geodetic metrizations of graphs
โœ Frank Rhodes; Robert A. Melter ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 665 KB

A graph can be metrized by assigning a length to each of its edges. Such a graph is said to be geodetic if for each pair of vertices there is a unique geodesic joining them. It is said to be normally geodetic if each of these unique geodesics is one of the geodesics in the usual metrization of the g

On the geodetic number of a graph
โœ Gary Chartrand; Frank Harary; Ping Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 308 KB
Geodetic graphs of diameter two
โœ A. Blokhuis; A. E. Brouwer ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer ๐ŸŒ English โš– 365 KB

We survey what is known on geodetic graphs of diameter two and discuss the implications of a new strong necessary condition for the existence of such graphs.