Pajek network: Graph Drawing contest 1997
Name GD97_b
Group Pajek
Matrix ID 1493
Num Rows 47
Num Cols 47
Nonzeros 264
Pattern Entries 264
Kind Undirected Weighted Graph
Symmetric Yes
Date 1997
Author Graph Drawing Contest
Editor V. Batagelj
Structural Rank
Structural Rank Full
Num Dmperm Blocks
Strongly Connect Components 2
Num Explicit Zeros 0
Pattern Symmetry 100%
Numeric Symmetry 100%
Cholesky Candidate no
Positive Definite no
Type real
SVD Statistics
Matrix Norm 2.841064e+03
Minimum Singular Value 0
Condition Number Inf
Rank 44
Null Space Dimension 3
Full Numerical Rank? no
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
Pajek network converted to sparse adjacency matrix for inclusion in UF sparse 
matrix collection, Tim Davis.  For Pajek datasets, See V. Batagelj & A. Mrvar,                                
Regarding conversion for UF sparse matrix collection: in the original data    
every edge appears exactly twice, with the same edge weight.  It could be a   
multigraph, but it looks more like a graph.  The duplicate edges are removed  
in this version.  You can always add them back in yourself; just look at 2*A. 
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.