For directedgraph
directed edges
Mi nun of
pron i to
a bc
t
y
o i o
Iii
Isomorphism
Lu E and Ga VaEr are
onetoone mapping
the
i
G
Invariants
properties
betweenvertices
adjacency relationship
is
i
if there is a
in v andun that preserves
isomorphic
as rn
that isomorphicgraphs
but not sufficient
u
n
most sham
necessary
nom of vertices
nom or cages
degree sequence
sequence
of degrees or verticesin nonincreasing order
Examples
4
a
as
d
a
Pb
Is
g
ii
5
let b
i
as
s
10,1
a
deg 33222
I I
z
ga
Ga
141 5
teal o
I
deg 4322
yetto
not isomorphic
x
leak10 r
deg 33332222 deg 33332222
r
of
degree
adjacent vertices
mustmatch
e.g vertex d in G
SirWiz
in G
II
vs
r
q
q
Map
ing
not
EEx
ers
x
a
3n
LE
u
deg4
8
des 143 a
au
3 deg
3
Isomorphic
E
141 5
if
as Va
43
no similarvertex ing
desca
havedeg 3
x
is it
I
d
d hasdeg s
I
5
leaks
deg 44332
deg4
deg4
U2 503 and at us
options Users and an us
as
uz
optionc
options
opt 1
adj
matrix
asun uaovs uasrs a su as u
as
no
n'ai
svnn.sn
4 w.us.su
is
f
a tess
a u andas r
a out and as a
it
s
o n o
va
vs
iiiii
x
1021
option 1
try option
cess
Isomorphic
I
Existence of simple circuit
of length K is an
isomorphic
h
O
a
for
a
lengths no
yes
x
Circuitor
length4 yes
yes
des 333322
deg 333322
circuitor
not iso
directed graphs
Invariants
non of vertices
num or edges
in degrees
out degrees
a
É to É
a
proposed
I
3
z
n
Isomorphism
Eal s
let S
so
invariant
j
Int
l
tell
lent y
deg
in out
r
in out
napping
b
g
d
F
c
e
p
oo o o
a b i d
t
e o o oo
f I n o
ng e
r
somonpace