| 1. | The adjacency matrix of an empty graph is a zero matrix.
|
| 2. | This is the Seidel adjacency matrix of a two-graph.
|
| 3. | Bonacich's family of measures does not transform the adjacency matrix.
|
| 4. | The alpha centrality replaces the adjacency matrix with its resolvent.
|
| 5. | The subgraph centrality replaces the adjacency matrix with its trace.
|
| 6. | A better estimate of adjacency matrix may produce variations in the indices.
|
| 7. | Let A be the adjacency matrix for G.
|
| 8. | The p-numbers are the eigenvalues of the adjacency matrix D _ i.
|
| 9. | This results in a directed weighted adjacency matrix, of a fully connected network.
|
| 10. | The entries in the adjacency matrix must be zero's and one's.
|
