Pajek/GD01_c
Pajek network: Graph Drawing contest 2001
| Name |
GD01_c |
| Group |
Pajek |
| Matrix ID |
1480 |
|
Num Rows
|
33 |
|
Num Cols
|
33 |
|
Nonzeros
|
135 |
|
Pattern Entries
|
135 |
|
Kind
|
Directed Multigraph |
|
Symmetric
|
No |
|
Date
|
2001 |
|
Author
|
Graph Drawing Contest |
|
Editor
|
V. Batagelj |
| Structural Rank |
|
| Structural Rank Full |
|
|
Num Dmperm Blocks
|
|
|
Strongly Connect Components
|
33 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
0% |
|
Numeric Symmetry
|
0% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
integer |
| SVD Statistics |
| Matrix Norm |
8.117270e+00 |
| Minimum Singular Value |
0 |
| Condition Number |
Inf
|
| Rank |
25 |
| sprank(A)-rank(A) |
|
| Null Space Dimension |
8 |
| 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.
|
