Voltar
Artigo Revisado por pares
BIBTEX RIS

Some upper bounds for permanents of (0, 1)-matrices

2007; Taylor & Francis; Volume: 10; Issue: 2 Linguagem: Inglês

10.1080/09720502.2007.10700483

ISSN

2169-012X

Autores

Ahmad Al-Kurdi,

Tópico(s)

Advanced Graph Theory Research

Resumo

Abstract Abstract In this paper, some upper bounds for computing the permanent of (0, 1) -matrices are given based on row sum and column index sets of each row. These bounds are shown to be better than those obtained by Minc-Bregman in terms of row sums. Finding permanent of a matrix is useful in several applications such as in combinatorics, graph theory and statistics and probability. However, computing permanent of a matrix is difficult and therefore having their upper bounds will be useful. Keywords: Permanentrow sum(0,1) -matrixupper bound

Referência(s)