Matrix: Pajek/GD99_b
Description: Pajek network: Graph Drawing contest 1999
(undirected graph drawing) |
Matrix properties | |
number of rows | 64 |
number of columns | 64 |
nonzeros | 252 |
# strongly connected comp. | 1 |
explicit zero entries | 0 |
nonzero pattern symmetry | symmetric |
numeric value symmetry | symmetric |
type | integer |
structure | symmetric |
Cholesky candidate? | no |
positive definite? | no |
author | Graph Drawing Contest |
editor | V. Batagelj |
date | 1999 |
kind | undirected multigraph |
2D/3D problem? | no |
Additional fields | size and type |
nodename | full 64-by-5 |
coord | full 64-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.98254 |
min(svd(A)) | 1.74874e-17 |
cond(A) | 2.27737e+17 |
rank(A) | 45 |
null space dimension | 19 |
full numerical rank? | no |
singular value gap | 2.0601e+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.