Matrix properties
number of rows	11
number of columns	11
nonzeros	41
structural full rank?	no
structural rank	10
# of blocks from dmperm	2
# strongly connected comp.	3
explicit zero entries	0
nonzero pattern symmetry	44%
numeric value symmetry	44%
type	binary
structure	unsymmetric
Cholesky candidate?	no
positive definite?	no

author	V. Batagelj
editor	V. Batagelj
date	1992
kind	directed graph
2D/3D problem?	no

Additional fields	size and type
nodename	full 11-by-9
coord	full 11-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, and have been removed.  This graph has 2D coordinates.                  

Ordering statistics:	AMD	METIS
nnz(chol(P*(A+A'+s*I)*P'))	48	53
Cholesky flop count	2.4e+02	3.0e+02
nnz(L+U), no partial pivoting	85	95
nnz(V) for QR, upper bound nnz(L) for LU	40	37
nnz(R) for QR, upper bound nnz(U) for LU	46	48

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