On the Structure of Edge Graphs II
β Scribed by Bollobas, B.; Erdos, P.; Simonovits, M.
- Book ID
- 120096159
- Publisher
- Oxford University Press
- Year
- 1976
- Tongue
- English
- Weight
- 125 KB
- Volume
- s2-12
- Category
- Article
- ISSN
- 0024-6107
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The edgeβtoughness __T__~1~(__G__) of a graph __G__ is defined as equation image where the minimum is taken over every edgeβcutset __X__ that separates __G__ into Ο (__G__ β __X__) components. We determine this quantity for some special classes of graphs that also gives the arboricity
We give formulas, in terms of the number of pure k-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs, extending our prior results for neighboring vertices and also extending results of Devroye-Sbihi and Biggs concerning dis