✦ LIBER ✦

On F-geodetic graphs

✍ Scribed by Raffaele Scapellato

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 868 KB
Volume: 80
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90250-l

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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.

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

An extremal problem in geodetic graphs

✍ K.R. Parthasarathy; N. Srinivasan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 365 KB

The minumum geodetic communication overl

The minumum geodetic communication overlap graphs

✍ J. Nieminen; M. Peltola 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 231 KB

We develop further the communication overlap index of Hong and Zuo in the case where the points of the graph communicate with each other through shortest paths (geodesics) of the graph. The structure of the graphs with minimum geodetic communication index is described, the concept of geodetic connec