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

author	Graph Drawing Contest
editor	V. Batagelj
date	1998
kind	undirected graph
2D/3D problem?	no

Additional fields	size and type
coord	full 112-by-2

Notes:

------------------------------------------------------------------------------
Pajek network converted to sparse adjacency matrix for inclusion in UF sparse 
matrix collection, Tim Davis.  For Pajek datasets, See V. Batagelj & A. Mrvar,
http://vlado.fmf.uni-lj.si/pub/networks/data/.                                
------------------------------------------------------------------------------
The original problem had 3D xyz coordinates, but all values of z were equal   
to 0.5, and have been removed.  This graph has 2D coordinates.                

SVD-based statistics:
norm(A)	3
min(svd(A))	8.52471e-17
cond(A)	3.51918e+16
rank(A)	100
null space dimension	12
full numerical rank?	no
singular value gap	3.10718e+14

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.