𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I

✍ Scribed by John Donald; John Elwin; Richard Hager; Peter Salamon

Book ID
107824981
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
760 KB
Volume
61
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the permanent of a no
An upper bound for the permanent of a nonnegative matrix
✍ Suk-Geun Hwang; Arnold R. KrΓ€uter; T.S. Michael πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 311 KB

Let A be a fully indecomposable, nonnegative matrix of order n with row sums rt,..., ~;,, and let s~ equal the smallest positive element in row i of A. We prove the permanental inequality 11 II per(A) ~< 1-I s, + IX('"-s;) i::1 i::1 and characterize the case of equality. In 1984 Donald, Elwin, Hager

A new upper bound for eigenvalues of the
A new upper bound for eigenvalues of the laplacian matrix of a graph
✍ Li Jiong-Sheng; Zhang Xiao-Dong πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 270 KB

We first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound.