✦ LIBER ✦

On the existence of graphs of diameter two and defect two

✍ Scribed by J. Conde; J. Gimbert

Book ID: 108114085
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 459 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.09.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.

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.

Diameter of the conjunction of two finit

Diameter of the conjunction of two finite graphs

✍ Roger H. Lamprey 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

The maximum genus of graphs of diameter

The maximum genus of graphs of diameter two

✍ Martin Škoviera 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Skoviera, M., The maximum genus of graphs of diameter two, Discrete Mathematics 87 (1991) 175-180. Let G be a (finite) graph of diameter two. We prove that if G is loopless then it is upper embeddable, i.e. the maximum genus y,&G) equals [fi(G)/Z], where /3(G) = IF(G)1 -IV(G)1 + 1 is the Betti numbe