Matrix properties
number of rows	101
number of columns	101
nonzeros	380
# 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	2006
kind	undirected graph
2D/3D problem?	no

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/.                                
------------------------------------------------------------------------------
 GD 2006 contest graph A: Theory                                              
 http://gd2006.org/contest/details.php#theory                                 
 graph in Pajek format                                                        
 transformed by Vladimir Batagelj, July 10, 2006                              

SVD-based statistics:
norm(A)	6.78233
min(svd(A))	4.89431e-48
cond(A)	1.38576e+48
rank(A)	20
null space dimension	81
full numerical rank?	no
singular value gap	5.07594e+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.