Matrix properties
number of rows	101
number of columns	101
nonzeros	380
structural full rank?	no
structural rank	20
# of blocks from dmperm	2
# strongly connected comp.	1
explicit zero entries	0
nonzero pattern symmetry	symmetric
numeric value symmetry	symmetric
type	binary
structure	symmetric
Cholesky candidate?	yes
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                              

Ordering statistics:	AMD	METIS
nnz(chol(P*(A+A'+s*I)*P'))	336	336
Cholesky flop count	1.3e+03	1.3e+03
nnz(L+U), no partial pivoting	571	571
nnz(V) for QR, upper bound nnz(L) for LU	721	721
nnz(R) for QR, upper bound nnz(U) for LU	3,401	3,401

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