𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Catalogues of graphs and digraphs

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
81 KB
Volume
31
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 other contains those with 21 or 22 edges. (The remaining graphs can be obtained by complementation.)

Each graph is represented by a coded adjacency matrix, and the order of its automorphism group is listed with it. The graphs are grouped according to their degree sequ,;: ,\ces.

These tapes can be obtained from us at an inclusive cost of $50 (US) per tape, i.e. $100 for the catalogue.

We can also supply a catalogue, on tape, of the digraphs on 4, 5 and 6 vertices. With each of these digraphs is listed information on some of its more important properties, namely. four kinds of connectivity, existence of a circuit or of a Hamilton circuit, and whether the digraph is self-converse or self-complementary. This tape can also be obtained for $50 (US).

The above catalogues are too large to be supplied other than on magnetic tape, but we can supply a hard-copy catalogue of all the 12,346 /graphs on 8 vertices. This consists of 167 pages of computer print-out, and gives each graph as an adjacency matrix, together with the order of its automorphism group. The graphs are grouped according to their degree sequences (which are shown

πŸ“œ SIMILAR VOLUMES

The connectivity of large digraphs and g
The connectivity of large digraphs and graphs
✍ 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

Distance connectivity in graphs and digr
Distance connectivity in graphs and digraphs
✍ Balbuena, M. C.; Carmona, A.; Fiol, M. A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 642 KB

Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i

Cycle packings in graphs and digraphs
Cycle packings in graphs and digraphs
✍ Jennifer J. Quinn πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 196 KB

A cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) elementary cycles. If D is a demiregular multidigraph we show that the arcs of D can be partitioned into Ai. cycle packings --where Ain is the maximum indegree of a vertex in D. We then show that the maximum len

Highly edge-connected detachments of gra
Highly edge-connected detachments of graphs and digraphs
✍ Alex R. Berg; Bill Jackson; Tibor JordΓ‘n πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 107 KB

## Abstract Let __G__ = (__V__,__E__) be a graph or digraph and __r__ : __V__ β†’ __Z__~+~. An __r__‐detachment of __G__ is a graph __H__ obtained by β€˜splitting’ each vertex Ξ½ ∈ __V__ into __r__(Ξ½) vertices. The vertices Ξ½~1~,…,Ξ½~__r__(Ξ½)~ obtained by splitting Ξ½ are called the __pieces__ of Ξ½ in __H