✦ LIBER ✦

Geodetic graphs of diameter two and some related structures

✍ Scribed by Raffaele Scapellato

Book ID: 107884232
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 636 KB
Volume: 41
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90045-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geodetic graphs of diameter two

✍ Joel G Stemple 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 750 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.

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.

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

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