Matrix: Pajek/GD97_c
Description: Pajek network: Graph Drawing contest 1997
|
|
| (bipartite graph drawing) | (graph drawing of A+A') |
 |
|
 |
 |
| Matrix properties | |
| number of rows | 452 |
| number of columns | 452 |
| nonzeros | 460 |
| # strongly connected comp. | 452 |
| 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 | 1997 |
| kind | directed multigraph |
| 2D/3D problem? | no |
| Additional fields | size and type |
| coord | full 452-by-3 |
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/. ------------------------------------------------------------------------------
| SVD-based statistics: | |
| norm(A) | 28.8796 |
| min(svd(A)) | 0 |
| cond(A) | Inf |
| rank(A) | 63 |
| null space dimension | 389 |
| full numerical rank? | no |
| singular value gap | 4.80855e+13 |
| 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.