𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Geodetic connectivity of graphs

✍ Scribed by Entringer, R.; Jackson, D.; Slater, P.

Book ID
117913922
Publisher
IEEE
Year
1977
Weight
547 KB
Volume
24
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimum 3-geodetically connected graphs
Minimum 3-geodetically connected graphs
✍ Martina Bosı́kovΓ‘ πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 793 KB

A graph G is k-geodetically connected (k-GC) if it is connected and the removal of at least k vertices is required to increase the distance between at least one pair of vertices or reduce G to a single vertex. We completely characterize the class of minimum 3-GC graphs that have the fewest edges for

The recognition of geodetically connecte
The recognition of geodetically connected graphs
✍ Jou-Ming Chang; Chin-Wen Ho πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 849 KB

Let G = ( y E) be a graph with vertex set V of size n and edge set E of size m. A vertex LJ E V is called a hinge vertex if the distance of any two vertices becomes longer after u is removed. A graph without hinge vertex is called a hinge-free graph. In general, a graph G is k-geodetically connected

Geodetic metrizations of graphs
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 uniformly geodetic graphs
On uniformly geodetic graphs
✍ J. H. Koolen πŸ“‚ Article πŸ“… 1993 πŸ› Springer Japan 🌐 English βš– 432 KB