✦ LIBER ✦

Geodetic graphs of diameter two

✍ Scribed by A. Blokhuis; A. E. Brouwer

Publisher: Springer
Year: 1988
Tongue: English
Weight: 365 KB
Volume: 25
Category: Article
ISSN: 0046-5755
DOI: 10.1007/bf00191941

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A note on geodetic graphs of diameter tw

A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares

✍ Ho-Jin Lee 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The structure of geodetic blocks with di

The structure of geodetic blocks with diameter two

✍ Mao Jingzhong 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB

## Abstract In this paper we prove that all geodetic blocks of diameter two can be divided in four types, i.e., Moore graphs with diameter two, regular pyramids with altitude 2, type AP and type PP. We also give the answers to the questions posed by J. G. Stemple in 1974.

Reduced graphs of diameter two

✍ Hong-Jian Lai 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract A graph __H__ is __collapsible__ if for every subset X ⊆ __V(H), H__ has a spanning connected subgraph whose set of odd‐degree vertices is X. In any graph __G__ there is a unique collection of maximal collapsible subgraphs, and when all of them are contracted, the resulting contraction

Erratum to: The structure of geodetic bl

Erratum to: The structure of geodetic blocks with diameter two

✍ Mao Jingzhong; Sun Lingli 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 38 KB

## Abstract In our paper 1 we gave a classification of geodetic blocks of diameter two, but the proof was incorrect. Here we point out this error and give a new result about constructing geodetic blocks of diameter two. © 2004 Wiley Periodicals, Inc. J Graph Theory 46 : 79–80, 2004

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

Maximal planar graphs of diameter two

✍ Karen Seyffarth 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 1020 KB

A maximal planar graph is a simple planar graph in which every face is a triangle. We show here that such graphs with maximum degree A and diameter two have no more than :A + 1 vertices. We also show that there exist maximal planar graphs with diameter two and exactly LiA + 1 J vertices.