We define the Laplacian ratio of a tree z(T), to be the permanent of the Laplacian matrix of T divided by the product of the degrees of the vertices. Best possible lower and upper bounds are obtained for ~r(T) in terms of the size of the largest matching in T.
โฆ LIBER โฆ
A bound for the permanent of the Laplacian matrix
โ Scribed by R.B. Bapat
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 296 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Permanent of the laplacian matrix of tre
โ
John L Goldwasser
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 715 KB
Permanent of the Laplacian matrix of tre
โ
Richard A Brualdi; John L Goldwasser
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 805 KB
be the Laplacian matrix of G. When G is a tree or a bipartite graph we obtain bounds for the permanent of L(G) both in terms of n only and in terms of d 1 ..... d,. Improved bounds are obtained in terms of the diameter of T and the size of a matching in T.
The Permanent Rank of a Matrix
โ
Yang Yu
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 91 KB
Define the perrank of a matrix A to be the size of the largest square submatrix of A with nonzero permanent. Motivated in part by the Alon Jaeger Tarsi Conjecture [3], we prove several results on perranks..
Unimodular congruence of the Laplacian m
โ
William Watkins
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 609 KB
A bound for the spectral radius of a mat
โ
James M Sloss
๐
Article
๐
1970
๐
Elsevier Science
๐
English
โ 181 KB
A lower bound for the permanent on Un(k,
โ
D.J Hartfiel; J.W Crosby
๐
Article
๐
1972
๐
Elsevier Science
๐
English
โ 239 KB