Matrix properties
number of rows	77
number of columns	77
nonzeros	508
# strongly connected comp.	1
explicit zero entries	0
nonzero pattern symmetry	symmetric
numeric value symmetry	symmetric
type	integer
structure	symmetric
Cholesky candidate?	no
positive definite?	no

author	D. Knuth
editor	M. Newman
date	1993
kind	undirected weighted graph
2D/3D problem?	no

Additional fields	size and type
nodename	full 77-by-16

Notes:

Network collection from M. Newman                                          
http://www-personal.umich.edu/~mejn/netdata/                               
                                                                           
The graph lesmis contains the weighted network of coappearances of         
characters in Victor Hugo's novel "Les Miserables".  Nodes represent       
characters as indicated by the labels and edges connect any pair of        
characters that appear in the same chapter of the book.  The values on the 
edges are the number of such coappearances.  The data on coappearances were
taken from D. E. Knuth, The Stanford GraphBase: A Platform for             
Combinatorial Computing, Addison-Wesley, Reading, MA (1993).               

SVD-based statistics:
norm(A)	65.0263
min(svd(A))	8.62319e-17
cond(A)	7.54086e+17
rank(A)	64
null space dimension	13
full numerical rank?	no
singular value gap	1.73019e+12

singular values (MAT file):	click here
SVD method used:	s = svd (full (A)) ;
status:	ok

For a description of the statistics displayed above, click here.

Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.