2 3 

Ex: given A    find A , A

2 3

 5 - 1
The matrix An×n is invertible if there exist Bn×n such that A×B=B×A=In
If An×n matrix, then A-1n×n exist only if |A|≠0

a b 
A22   
 c d 
| A | ad  bc
1 1 d -b 
A 
| A |  c a 
4 3
Ex : find   inverse if exist
3 2 
 a b c 
A33  d e f 
 g h i 
| A | a(ei  fh)  b(di  fg )  c(dh  eg )
if | A | 0 then A313 exist
ei-fh di-fg dh-eg 
Step 1 : bi-ch ai-cg ah-bg 
bf-ce af-cd ae-bd 
 ei-fh  (di-fg ) dh-eg   j k m 
Step 2 :  (bi-ch) ai-cg  (ah-bg )  n o p 
 bf-ce  (af-cd ) ae-bd  q r s 
 j n q
Step 3 : k o r 
m p s 
 j n q
1  
Step 4 : A-1  k o r
| A|  
m p s 
 1 2 3 
Ex : find 3 2 1  inverse if exist
2 1 3
 Graph
If an organization has six different computers {A,B,C,D,E,F}. They want to connect these
computers as following:
A with B,C,D and E
ᴏA ᴏB
B with A and C
C with A,B,,D and E ᴏF ᴏC

D with A and C
ᴏD
E with A,C and F ᴏE
F with E

ᴏ: vertices
Line: edge
A graph consists of a set of edges connecting various vertices.

e2

loop
isolated
ᴏV4
ᴏV5 e1
e3
ᴏV3

parallel e4 e5
ᴏV1
ᴏV2

V(G)={V1, V2, V3, V4, V5}

E(G)={e1, e2, e3, e4, e5}
Ex: Are the two following diagrams represent same graph.

ᴏA ᴏA

ᴏE ᴏC
ᴏB ᴏD

ᴏD ᴏB ᴏE
ᴏC

Edge End point

{A,D}
{D,B}
{B,E}
{E,C}
{C,A}
End point ={ }
ᴏA

E(G)= ф ᴏA
V(G)≠ 0
G is empty if V(G)=0
Ex: Draw the graph of the following edge-endpoint function in two different ways.
edge endpoint

e1 {v1,v3}
e2 {v2,v4}
e3 {v2,v4}
e4 {v3}
Def: a direct edge e is an edge associated with two distinct endpoints.
Def: a direct graph is a graph G where each edge is directed.

Aᴏ ᴏB Aᴏ ᴏB Aᴏ ᴏB

ᴏC ᴏC ᴏC

Aᴏ ᴏB

ᴏC
Def: a simple graph is a graph G which has no:
1. Loops.
2. Parallel edges.

ᴏB
Aᴏ Aᴏ ᴏB Aᴏ

Cᴏ
Ex: V(G)={U,V,W,X}
Draw all simple graphs with two edges, one of them is {U,W}
Def: a complete graph on n-vertices (denoted by kn) is a simple graph of n-vertices, such that
between each two distinct vertices there is exactly one edge.
Ex: draw k1, k2, k3, k4