𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs of diameter two with no 4-circuits

✍ Scribed by J.A. Bondy; P. Erdös; S. Fajtlowicz

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
219 KB
Volume
200
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reduced graphs of diameter two
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

Maximal planar graphs of diameter two
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.

Valency of Distance-regular Antipodal Gr
Valency of Distance-regular Antipodal Graphs with Diameter 4
✍ Štefko Miklavič 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for