A bound for the permanent of the Laplacian matrix

Bapat, R. B. (1986) A bound for the permanent of the Laplacian matrix Linear Algebra and its Applications, 74 . pp. 219-223. ISSN 0024-3795

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/0...

Related URL: http://dx.doi.org/10.1016/0024-3795(86)90124-2

Abstract

It is shown that if G is a simple connected graph on n vertices, then perL(G)≥ 2(n - 1)K(G), where L(G) is the Laplacian matrix of G and K(G) is the complexity of G.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:78318
Deposited On:19 Jan 2012 06:30
Last Modified:19 Jan 2012 06:30

Repository Staff Only: item control page