𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probability of diameter two for Steinhaus graphs

✍ Scribed by Neal Brand; Stephen Curran; Sajal Das; Tom Jacob

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
454 KB
Volume
41
Category
Article
ISSN
0166-218X

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.

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

Graphs of diameter two with no 4-circuit
Graphs of diameter two with no 4-circuits
✍ J.A. Bondy; P. ErdΓΆs; S. Fajtlowicz πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 219 KB