Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
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.
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Yi Zhou, Parikshit Ram, et al.
ICLR 2023