论文信息 - Oriented subtrees of an arc digraph

Oriented subtrees of an arc digraph

Abstract A simple formula can be given for the number of subtrees of the arc digraph D* of a directed graph D, in terms of the number of subtrees of D, thereby generalizing certain results of van Aardenne-Ehrenfest and de Bruijn [1].

Donald E. Knuth | D. Knuth

[1] W. T. Tutte. The dissection of equilateral triangles into equilateral triangles , 1948, Mathematical Proceedings of the Cambridge Philosophical Society.

[2] R. Z. Norman,et al. Some properties of line digraphs , 1960 .

[3] de Ng Dick Bruijn. A combinatorial problem , 1946 .

[4] de Ng Dick Bruijn,et al. Circuits and Trees in Oriented Linear Graphs , 1951 .