Permanents of Graphs with Cut Vertices

Linear and Multilinear Algebra

Volumn 51, Issue 4, 2003, Pages 393-404

  Hwang, Suk Geun ^a   Zhang, Xiao Dong ^b  

^a Kyungpook National University   (South Korea)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Cut vertex; Derangement number; Graph; Permanent

Indexed keywords

EID: 0142138185     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: 10.1080/0308108031000106649     Document Type: Article

References (10)

1. A. Berman and X.-D. Zhang (2001). On the spectral radius of graphs with cut vertices, J. Combin. Theory, Ser. B, 83, 233-240.
2. R.A. Brualdi, J.L. Goldwasser and T.S. Michael (1988). Maximum permanents of matrices of zeros and ones. J. Combin. Theory, Ser. A, 47, 207-245.
3. B. Codenotti, V. Crepsi and G. Resta (1997). On the permanent of certain (0, 1) Toeplitz matrices, Linear Algebra Appl., 267, 65-100.
4. R. Diestel (2000). Graph Theory, 2nd Edn., Graduate Texts in Mathematics, 173. Springer, New York.
5. S.M. Fallat and C.R. Johnson (1999). Sub-direct sums and positivity classes of matrices. Linear Algebra Appl., 288, 149-173.
6. E.J. Farrell, J.W. Kennedy and L.V. Quintas (2000). Permanents and determinants of graphs: a cycle polynomial approach. J. Combin. Math. Combin. Comput., 32, 129-137.
7. H. Minc (1978). Permanents, Encyclopedia of Mathematics and Its Applications, Vol. 6. Addison-Wesley Publishing Co., Reading, Mass.
8. G.W. Soules (2000). Extending the Minc-Bregman upper bound for the permanent. Linear and Multilinear Algebra, 47, 77-91.
9. L.G. Valiant (1979). The complexity of computing the permanent. Theoret. Comput. Sci., 8, 189-201.
10. I.M. Wanless (1999). Maximising the permanent at the complementary permanent of (0, 1)-matrices with constant line sum. Discrete Math., 205, 191-205.