Geodesic
The permanent of the Laplacian matrix of a bipartite graph
Czechoslovak Mathematical Journal, Tome 36 (1986) no. 1, pp. 7-17
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1986.102059
Classification : 05C35, 05C50, 15A15 
@article{10_21136_CMJ_1986_102059,
     author = {Vrba, Anton{\'\i}n},
     title = {The permanent of the {Laplacian} matrix of a bipartite graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {7--17},
     year = {1986},
     volume = {36},
     number = {1},
     doi = {10.21136/CMJ.1986.102059},
     mrnumber = {822860},
     zbl = {0603.05029},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1986.102059/}
}
TY  - JOUR
AU  - Vrba, Antonín
TI  - The permanent of the Laplacian matrix of a bipartite graph
JO  - Czechoslovak Mathematical Journal
PY  - 1986
SP  - 7
EP  - 17
VL  - 36
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1986.102059/
DO  - 10.21136/CMJ.1986.102059
LA  - en
ID  - 10_21136_CMJ_1986_102059
ER  - 
%0 Journal Article
%A Vrba, Antonín
%T The permanent of the Laplacian matrix of a bipartite graph
%J Czechoslovak Mathematical Journal
%D 1986
%P 7-17
%V 36
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1986.102059/
%R 10.21136/CMJ.1986.102059
%G en
%F 10_21136_CMJ_1986_102059
Vrba, Antonín. The permanent of the Laplacian matrix of a bipartite graph. Czechoslovak Mathematical Journal, Tome 36 (1986) no. 1, pp. 7-17. doi: 10.21136/CMJ.1986.102059

[1] W. N. Anderson, T. D. Morley: Eigenvalues of the Laplacian of a graph. TR 71 - 45, University of Maryland technical report, 1971.

[2] M. Fiedler: Algebraic connectivity of graphs. Czech. Math. J. 23 (1973), 298-305. | MR | Zbl

[3] M. Fiedler: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J. 25 (1975), 619-633. | MR | Zbl

[4] M. Fiedler: Algebraische Zusammenhangszahl und ihre numerische Bedeutung. ISNM 29, Birkhäuser, Basel 1975. | MR

[5] M. Fiedler, J. Sedláček: On $W$-bases of directed graphs. (in Czech; Russian and German summary), Čas. pěst. mat. 83 (1958), 214-225. | MR

[6] H. M. Trent: A note on the enumeration and listing of all possible trees in a connected linear graph. Proc. Nat. Acad. Sci. USA 40 (1954), 1004-1007. | DOI | MR | Zbl

[7] A. Vrba: Subdeterminants and subgraphs. Čas. pěst. mat. 99 (1974), 64-76. | MR | Zbl

[8] R. Merris K. R. Rebman, W. Watkins: Permanental polynomials of graphs. Lin. Alg. Appl. 38 (1981), 273-288. | DOI | MR

[9] R. Merris: The Laplacian permanental polynomial for trees. Czech. Math. J. 32 (1982), 397-403. | MR | Zbl

[10] H. Mine: Permanents. Addision-Wesley 1978.

[11] M. Marcus, H. Minc: A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston 1964. | MR | Zbl

Cité par Sources :