Matrix: Pajek/GD01_c

Description: Pajek network: Graph Drawing contest 2001

 (bipartite graph drawing) (graph drawing of A+A')

• Home page of the UF Sparse Matrix Collection
• Matrix group: Pajek
• Click here for a description of the Pajek group.
• Click here for a list of all matrices
• Click here for a list of all matrix groups
• download as a MATLAB mat-file, file size: 2 KB. Use UFget(1480) or UFget('Pajek/GD01_c') in MATLAB.
• download in Matrix Market format, file size: 1 KB.
• download in Rutherford/Boeing format, file size: 1 KB.

 Matrix properties number of rows 33 number of columns 33 nonzeros 135 # strongly connected comp. 33 explicit zero entries 0 nonzero pattern symmetry 0% numeric value symmetry 0% type integer structure unsymmetric Cholesky candidate? no positive definite? no

 author Graph Drawing Contest editor V. Batagelj date 2001 kind directed multigraph 2D/3D problem? no

 Additional fields size and type partition full 33-by-1 nodename full 33-by-4 coord full 33-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,
------------------------------------------------------------------------------
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.
```

 SVD-based statistics: norm(A) 8.11727 min(svd(A)) 0 cond(A) Inf rank(A) 25 null space dimension 8 full numerical rank? no singular value gap 3.31863e+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.