✦ LIBER ✦

The geodetic number of a graph

✍ Scribed by Frank Harary; Emmanuel Loukakis; Constantine Tsouros

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 406 KB
Volume: 17
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(93)90259-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the geodetic number of a graph

✍ Gary Chartrand; Frank Harary; Ping Zhang 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

The Geodetic Number of an Oriented Graph

✍ Gary Chartrand; Ping Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

For two vertices u and v of an oriented graph D, the set I (u, v) consists of all vertices lying on a uv geodesic or vu geodesic in D. If S is a set of vertices of D, then I (S) is the union of all sets I (u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the

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

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 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.

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