Pajek/GD01_b
Pajek network: Graph Drawing contest 2001
Name |
GD01_b |
Group |
Pajek |
Matrix ID |
1479 |
Num Rows
|
18 |
Num Cols
|
18 |
Nonzeros
|
37 |
Pattern Entries
|
37 |
Kind
|
Directed Graph |
Symmetric
|
No |
Date
|
2001 |
Author
|
Graph Drawing Contest |
Editor
|
V. Batagelj |
Structural Rank |
|
Structural Rank Full |
|
Num Dmperm Blocks
|
|
Strongly Connect Components
|
1 |
Num Explicit Zeros
|
0 |
Pattern Symmetry
|
51.4% |
Numeric Symmetry
|
51.4% |
Cholesky Candidate
|
no |
Positive Definite
|
no |
Type
|
binary |
SVD Statistics |
Matrix Norm |
2.357970e+00 |
Minimum Singular Value |
4.256050e-17 |
Condition Number |
5.540278e+16
|
Rank |
17 |
sprank(A)-rank(A) |
|
Null Space Dimension |
1 |
Full Numerical Rank? |
no |
Download Singular Values |
MATLAB
|
Download |
MATLAB
Rutherford Boeing
Matrix Market
|
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/.
------------------------------------------------------------------------------
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.
|