|
|
|
Adjacency Matrices - Software Testing |
The adjacency matrix of a graph is a useful supplement to the incidence matrix |
The adjacency matrix of a graph is a useful supplement to the incidence matrix. Because adjacency matrix deal with connections, they are the basic of many later graph theory concepts.
Definition:
The adjacency matrix of a graph G = (V, E) with m node is an m multiply m matrix. Where the element in row i, column j is a 1 if and only if an edge exists between node i and node j; otherwise, the element is 0.
The adjacency matrix is symmetric (element i, j always equals element j, i) and row sum is the degree of the node (as it was in the incidence matrix). The adjacency matrix of the graph in figure is: | n1 | n2 | n3 | n4 | n5 | n6 | n7 | n1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | n2 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | n3 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | n4 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | n5 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | n6 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | n7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | |
 |
Related Words: |
|
Adjacency Matrices, Paths, Connectedness, Condensation Graph, Cyclomatic Number, Directed Graph, Software Testing Notes, Online Software Testing Papers, Graph Theory Testing Papers, Software Testing Classnotes, Software Testing Related Online Papers, Online Software Testing Notes
|
|
|
|
7/1/2009
Print This Page
Tell - A - Friend
Add to Wish List
Report Error