Pajek/GD06_theory
Pajek network: Graph Drawing contest 2006
Name |
GD06_theory |
Group |
Pajek |
Matrix ID |
1484 |
Num Rows
|
101 |
Num Cols
|
101 |
Nonzeros
|
380 |
Pattern Entries
|
380 |
Kind
|
Undirected Graph |
Symmetric
|
Yes |
Date
|
2006 |
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
|
100% |
Numeric Symmetry
|
100% |
Cholesky Candidate
|
no |
Positive Definite
|
no |
Type
|
binary |
SVD Statistics |
Matrix Norm |
6.782330e+00 |
Minimum Singular Value |
4.894311e-48 |
Condition Number |
1.385758e+48
|
Rank |
20 |
sprank(A)-rank(A) |
|
Null Space Dimension |
81 |
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/.
------------------------------------------------------------------------------
GD 2006 contest graph A: Theory
http://gd2006.org/contest/details.php#theory
graph in Pajek format
transformed by Vladimir Batagelj, July 10, 2006
|