论文信息 - Acyclic Digraphs and Eigenvalues of O,1 Matrices - 字舞流文

Acyclic Digraphs and Eigenvalues of O,1 Matrices

We show that the number of acyclic directed graphs with n labeled vertices is equal to the number of n X n (0,1)-matrices whose eigenvalues are positive real numbers.

H. Wilf | B. McKay | F. Oggier | G. Royle | I. Wanless | Neil J. A. Sloane

[1] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[2] Ira M. Gessel,et al. Counting acyclic digraphs by sources and sinks , 1996, Discret. Math..

[3] Edward A. Bender,et al. The asymptotic number of acyclic digraphs, II , 1988, J. Comb. Theory, Ser. B.

[4] Edward A. Bender,et al. The asymptotic number of acyclic digraphs. I , 1986, Comb..

[5] Victor A. Nicholson,et al. Matrices with permanent equal to one , 1975 .

[6] Richard P. Stanley,et al. Acyclic orientations of graphs , 1973, Discret. Math..

[7] F. Harary. New directions in the theory of graphs , 1973 .