Matrix properties
number of rows	11
number of columns	11
nonzeros	48
# strongly connected comp.	1
explicit zero entries	0
nonzero pattern symmetry	50%
numeric value symmetry	50%
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-10

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/.                                
------------------------------------------------------------------------------
 STUDENT GOVERNMENT OF UNIVERSITY OF LJUBLJANA (Hlebec 1992)                  
 discussion, recognition                                                      

SVD-based statistics:
norm(A)	5.20264
min(svd(A))	6.74618e-19
cond(A)	7.71198e+18
rank(A)	10
null space dimension	1
full numerical rank?	no
singular value gap	2.52051e+17

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.