Diagnosis and FTC by Prof. Blanke [pdf] - NTNU

45
46
Digraph for linear system
Example 5. 2
d
c1: x1 = x1
dt
c2 : x1 = ax2
d
c3 : x2 = x2
dt
c : x = bx + cx + du
4 2 1 2
Bipartite graph
Graph represented as
incidence matrix:
u x1 x2 x1 x2
c1
0 1 0 1 0
c2
0 0 1 1 0
c3
0 0 1 0 1
c 1 1 1 0 1
4
Graph represented as the
incidence matrix:
u x1 x2 x1 x2
c1
0 1 0 1 0
c2
0 0 1 1 0
c3
0 0 1 0 1
c 1 1 1 0 1
4
Or drawn as a bipartite graph:
N N N
Mogens Blanke – Spring 2006
N K
? ? ? ! ? "
"A simple graph is one with no parallel edges and loops.
A bipartite graph is a simple graph in which the set of
vertices can be partitioned into two sets such that every
edge is between a vertex in C and a vertex in Z: G= ( C, Z, E)
."
Mogens Blanke – Spring 2006
23