𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The length of a circuit in a strongly connected graph

✍ Scribed by V. G. Vizing; M. K. Gol'dberg

Book ID
105058247
Publisher
Springer US
Year
1972
Tongue
English
Weight
322 KB
Volume
5
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The w-median of a connected strongly cho
The w-median of a connected strongly chordal graph
✍ Hai-Yen Lee; Gerard J. Chang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 337 KB πŸ‘ 1 views

## Abstract Suppose __G = (V, E)__ is a graph in which every vertex __x__ has a non‐negative real number __w(x)__ as its weight. The __w__‐distance sum of a vertex __y__ is __D~G, w~(y)__ = Οƒ~xβ‰…v~ __d(y, x)w(x).__ The __w__‐median of __G__ is the set of all vertices __y__ with minimum __w__‐distanc

A note on k-strongly connected orientati
A note on k-strongly connected orientations of an undirected graph
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 168 KB

Each k-strongly connected orientation of an undirect:7d I.&P A \_an be obtained from any other k-strongly connected orientation by reversing consec aLir :!I 3irected paths or circuits without destroying the k-strong connectivity.