Testing the -disconnectivity of graphs and digraphs
โ Scribed by Yuichi Yoshida; Yusuke Kobayashi
- Book ID
- 113927697
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 393 KB
- Volume
- 434
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We have recently completed the computer generation of a catalogue of all the 12,(b05,168 unlabelled graphs on 10 vertices, and are willing to make this catalogue available to those interested. The catalogue consists of two magnetic tapes; one contains all ten-vertex graphs on up to 20 edges, the ot
## Abstract This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order __n__, minimum degree ฮด, maximum degree ฮ, diameter __D__, and a new parameter l~pi;~, __0__ โค ฯ โค ฮด โ 2, related with the number of short paths (in the case of graphs