๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Eigenvalues of graphs and digraphs
โœ C.D. Godsil ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 483 KB
Catalogues of graphs and digraphs
๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 81 KB

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

The connectivity of large digraphs and g
โœ M. A. Fiol ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 632 KB

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