✦ LIBER ✦

On the average genus of a graph

✍ Scribed by Jonathan L. Gross; E. Ward Klein; Robert G. Rieper

Publisher: Springer Japan
Year: 1993
Tongue: English
Weight: 535 KB
Volume: 9
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02988301

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the average genus of the random graph

✍ Saul Stahl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 640 KB

## Abstract We obtain an upper bound on the expected number of regions in the randomly chosen orientable embedding of a fixed graph. This bound is ised to show that the average genus of the random graph on __v__ vertices is close to its maximum genus. More specifically, it is proven that the differ

Structure for a graph with average genus

✍ Yichao Chen; Yanpei Liu; Rongxia Hao 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 222 KB

On the maximum genus of a graph

✍ E.A Nordhaus; B.M Stewart; A.T White 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 415 KB

Bounds for the average genus of the vert

Bounds for the average genus of the vertex-amalgamation of graphs

✍ Saul Stahl 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 628 KB

The average orientable genus of graphs has been the subject of a considerable number of recent investigations. It is the purpose of this article to examine the extent to which the average genus of the amalgamation of graphs fails to be additive over its constituent subgraphs. This discrepancy is bou

A note on approximating graph genus

✍ Jianer Chen; Saroja P. Kanchi; Arkady Kanevsky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Bounds on the average connectivity of a

Bounds on the average connectivity of a graph

✍ Peter Dankelmann; Ortrud R. Oellermann 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 235 KB

In this paper, we consider the concept of the average connectivity of a graph, deÿned to be the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. We establish sharp bounds for this parameter in terms of the average degree and improve o