| 11. | An initial transformation of the adjacency matrix allows differing definition of the type of walk counted.
|
| 12. | The PageRank values are the entries of the dominant right eigenvector of the modified adjacency matrix.
|
| 13. | The adjacency matrix of a directed graph is unique up to identical permutation of rows and columns.
|
| 14. | All eigenvalues of the adjacency matrix A of a line graph are at least & minus; 2.
|
| 15. | It is also the adjacency matrix of the two-graph associated with " G ".
|
| 16. | A random graph of size n can be represented as a random n \ times n adjacency matrix.
|
| 17. | This method uses graph information, but the construction of adjacency matrix makes this method hard to analyze.
|
| 18. | The adjacency matrix of a complete graph contains all ones except along the diagonal where there are only zeros.
|
| 19. | With an adjacency matrix, an entire row must instead be scanned, which takes O ( ) time.
|
| 20. | Now let A be an n \ times n adjacency matrix with entries in { 0, 1 }.
|
