𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the time to traverse all edges of a graph

✍ Scribed by David Zuckerman

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
293 KB
Volume
38
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the intersection of edges of a geomet
On the intersection of edges of a geometric graph by straight lines
✍ N. Alon; M.A. Perles πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 969 KB

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0

On the edge-connectivity vector of a gra
On the edge-connectivity vector of a graph
✍ Linda M. Lesniak; Raymond E. Pippert πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 202 KB
On the edge-toughness of a graph. II
On the edge-toughness of a graph. II
✍ Y. H. Peng; T. S. Tay πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 558 KB

## 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