𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm for r-Bases of a Directed Graph

✍ Scribed by J. R. Brown

Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
191 KB
Volume
6
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for finding factorizations
An algorithm for finding factorizations of complete graphs
✍ A. J. W. Hilton; Matthew Johnson πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003

An algorithm for the decomposition of gr
An algorithm for the decomposition of graphs into cliques
✍ Xiang-Ying Su πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 340 KB πŸ‘ 1 views

## Abstract Chung (F. R. K. Chung, On the decomposition of graphs, __SIAM J. Algebraic Discrete Methods__ 23 (1981), 1–12.) and independently GyΓΆri and Kostochka (E. GyΓΆri and A. V. Kostochka, On a problem of G. O. H. Katona and T. TarjΓ‘n, __Acta Math. Acad. Sci. Hung.__ 34 (1979), 321–327.) proved

On the distance matrix of a directed gra
On the distance matrix of a directed graph
✍ R. L. Graham; A. J. Hoffman; H. Hosoya πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _