𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The radius of -connected planar graphs with bounded faces

✍ Scribed by Patrick Ali; Peter Dankelmann; Simon Mukwembi

Book ID
119227550
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
211 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the radius of a 3-con
An upper bound for the radius of a 3-connected graph
✍ Jochen Harant πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 286 KB

For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the

Bounding the number of embeddings of 5-c
Bounding the number of embeddings of 5-connected projective-planar graphs
✍ Shigeru Kitakubo πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c( 1120).

The spectral radius of a planar graph
The spectral radius of a planar graph
✍ Dasong Cao; Andrew Vince πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 438 KB