✦ LIBER ✦

Geodetic graphs of diameter two

✍ Scribed by Joel G Stemple

Book ID: 107884017
Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 750 KB
Volume: 17
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90033-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Geodetic graphs of diameter two and some

Geodetic graphs of diameter two and some related structures

✍ Raffaele Scapellato 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 636 KB

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

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

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.

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.