Conference paper
Lung function measurement by optical contouring
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989
Paper
On graphs whose least eigenvalue exceeds - 1 - √2
Abstract
Let G be a graph, A(G) its adjacency matrix. We prove that, if the least eigenvalue of A(G) exceeds -1 - √2 and every vertex of G has large valence, then the least eigenvalue is at least -2 and G is a generalized line graph. © 1997.
Related
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Heng Cao, Haifeng Xi, et al.
WSC 2003
Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997