论文信息 - Counting spanning trees in directed regular multigraphs

Counting spanning trees in directed regular multigraphs

Abstract The problem of counting spanning trees in regular multigraphs is considered. The emphasis is on the case of directed trees. It is shown that the numbers of spanning in-trees and out-trees with respect to any point of a regular multigraph are the same. A general formula for counting directed spanning trees with the use of graph eigenvalues is introduced. Formulae for computing eigenvalues of Cayley multigraphs are presented.

Michael R. Fellows | Jacek Wojciechowski

[1] Jhing-Fa Wang,et al. On the number of spanning trees of circulant graphs , 1984 .

[2] László Babai,et al. Spectra of Cayley graphs , 1979, J. Comb. Theory B.

[3] B. Elspas,et al. Graphs with circulant adjacency matrices , 1970 .

[4] S. D. Bedrosian. Tree counting polynomials for labelled graphs part I: Properties , 1981 .

[5] B. Golden,et al. Counting Trees in a Certain Class of Graphs , 1975 .

[6] R. Vohra,et al. Counting spanning trees in the graphs of Kleitman and Golden and a generalization , 1984 .

[7] S. D. Bedrosian,et al. On generic forms of complementary graphs , 1983 .

[8] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .