Matrix: Pajek/GD97_a
Description: Pajek network: Graph Drawing contest 1997
(undirected graph drawing) |
Matrix properties | |
number of rows | 84 |
number of columns | 84 |
nonzeros | 332 |
# strongly connected comp. | 1 |
explicit zero entries | 0 |
nonzero pattern symmetry | symmetric |
numeric value symmetry | symmetric |
type | binary |
structure | symmetric |
Cholesky candidate? | no |
positive definite? | no |
author | Graph Drawing Contest |
editor | V. Batagelj |
date | 1997 |
kind | directed graph |
2D/3D problem? | no |
Additional fields | size and type |
coord | full 84-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) | 3.96717 |
min(svd(A)) | 5.84518e-17 |
cond(A) | 6.78708e+16 |
rank(A) | 80 |
null space dimension | 4 |
full numerical rank? | no |
singular value gap | 5.95171e+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.