𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on average multiplicity

✍ Scribed by Jnanadeva Maharana; Lambodar P. Singh

Publisher
Springer
Year
1976
Tongue
English
Weight
163 KB
Volume
1
Category
Article
ISSN
0377-9017

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Lower bounds for the average genus
Lower bounds for the average genus
✍ Jianer Chen; Jonathan L. Gross; Robert G. Rieper πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 705 KB

Two lower bounds are obtained for the average genus of graphs. The average genus for a graph of maximum valence at most 3 is at least half its maximum genus, and the average genus for a 2-connected simplicial graph other than a cycle is at least 1/16 of its cycle rank.