[igraph] Eigenpairs of sparse graphs

[David Morton]

Hello,
I need to compute some extremal eigenvalues/eigenvectors of
adjacency and Laplacian matrices for very large and sparse graphs.
(to large for the matrices to be represented in their dense form anyway). 

Given the graphs, how can I achieve this task with igraph?

Thanks,
David Morton de Lachapalle.