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
Exact colorations of graphs and digraphs
β Scribed by Martin G. Everett; Stephen P. Borgatti
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 648 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0378-8733
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu