Download as pdf or txt
Download as pdf or txt
You are on page 1of 62

371.

95
691

o o
or : 2551
62 o
ISBN 978-974-559-550-7
1. o -
2. o-r 3.

o o
or
r .
r 1

rn

or

5 /2552
2551
1,000 n
o

99/20 10300
r 0-2668-7974 0-2668-7123 n 2530
0-2243-1129, 0-2668-7329
Web site: http:// www.onec.go.th http:// www.thaigifted.org

580 n 8 . 34 1
. no 10230
r 0-2943-8373-4 0-2510-7753


n ..2542 o ( 2) ..2545
10 ooo
28 oo
o o
n non
nr
n onnoo
r (o e 2547)
(Acceleration Program) }
oor o oo
o ro
n }nnoon
oon }jno
o
n
n } o
oor }n
on noo o 5 o
6 nn}n}oo
o oro
n r n
o
r r
r r r o r n r
n oror
}nnroo }rnor
n

(r )


n .. 2542 o ( 2) ..2545
10 ( 4) o o o o
28 n
n o
on no

on
ne 2543 oo
n n
n School in school Program e 2547 onn
o o
Gifted Education n o
(Acceleration Program) }noo nno
r (Enrichment
Program) on }oon
noor r o{ o{
o onnn (n oo 3
6 or o 5 6 }o)
or (Extension Program) o
rno (mentor) }
} n AP Program (Advanced
Placement Program) no }
n n o o } o
o o
nono
on } 18 n or
o (Acceleration
Program)
o 5 (o 6 )
on o noo
n n n n n
(onno)
} o o o o o
Pre-test Post-test

o
or

1
2
1
2

e 6
1

e 5

e 4

1.
2. o
3. r
4. o
5. r
6. r{r
7.
8. o

10
6
24
38
38
30
48
6
200

9. {rr
10. rr r
11. r 2 3
12. o

27
20
36
24

o
r

13.
14.
15. {r r{r

16. n
17. n}
18. r{ro
on (12 )
o (25 )
r{r (13 )

15
38
40

n
.

200
30
20
50

o
n

o
.

n
o
r

100


1
1
1
2
2
2
3
4
5
3 ()
1
4 ()
6
5 ()
7
6 ()
8
9
10
11
12
13

1
4
7
8
10
13
16
20
21
23
30
33
35
37
40
45
48
49
50
51
52
53

o 1
o
r

e 5
2

o
oor (mathematical
model) o{r {o o
o{ nr{
1. ro
1.1 o or
o{r o{
1.2 o{o
1.3 / ro
2.

oo o
oro{o
3.
x
x oro
4. o
o
1
1. or}nno
2. o 1 oo n 20 oo
on 5 ono 1 oooo

3. onnn onn
o{n
4. o o 1 f 1
5. oo noo o
6. o 1 f 1 noon {o

2
7. oon 4 - 5 of 2 o n n
nn
8. nf 2 n
n 1
1 C o A o B o A o D o B o C
1

C o Ao B o Ao D o B o C

2
C o B o D o Ao B o
Ao C

5. no
x o 1
x f 1 2
6.

1. oo
2. o
3. o

x f f
1.

2.
o

r
x no 90%
x no 90%
x n 90%

7.
.
.
.
.
.
.
.
.
.
.
.

8.
.
.
.
.
.
.
.

..

o 1

{ o o n } n o{n
nn{or {o {o }o r
no{o {no} r
(mathematical model) orroo
r o{n}no nor

{n oon ron
o or (diagram)
oon (graph) n{non {
onrr {n }o
on no{n
o{ (puzzle) n n
} ono

{rr
( The konigsberg Bridges Problem ) nn
rr 2 n 7 2 {~
n (Pregel River)

o B C {~o A D
{ }ono nnoo
on

n ooe .. 1736 r r (Leonherd Euler)


rrro rn }no
{nonn} ooo oo{
no r nonn}
nr ( Kirchhoff ..1824 1887 ) r ( Cayley .. 1821 1895 ) o
oo n ro{ j o
oo oo ( Tree ) oo} nro
oooo{r
{o n { (Hamilton .. 1805
1865 ) {o ( The Four Color Problem ) {}
{
r oo{n on
1) {r ( The Chinese Postman Problem ) {nn on
n ronr
ro non
nr oon o
2) {on o o ooo 9 o
non noo

F
H

3) {o{r (Designing And Efficient Computer Drum) o


o{oj 2 } 0
} 1 n }n n nn
j () nn n} 1 (j
no) nno} 0 (jnno)
4) { ( Utilities Problem ) n np nj }o
5) ror (Enumerative Isomers Alkanes)
6) rn ( Around the World ) e .. 1859 r r
( Sir William Hamilton .. 1805 1865 ) or o}
12 o ( Dodecahedron ) 20 o 30 o o
3 o onn 20 n {r
oonn on
on on
7) {o ( The Four Color Problem ) {}{
n noo n
{ oo oooo

f 1

... ...
o oo
1. o o 1
2. o 1 oo n
2.1 } ...
2.2 r ( Kirchhoff ..1824 1887 ) oroo{..
.
.
.
.
2.3 oo{oo n 5 n
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

f 2
r ( mathematical model )
... ...
n 1.1 n 4 A , B , C D 2 A B 1
A C 1 A D 1 B D 1
B C
{ C ono C on
o A , B , C D n on 2

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

n 1.2 no oo

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

10

o 2
o
r

e 5
2

o
no (vertex) o (edge) o
(multigraph edges) (simple graph) (multigraph) (loop)
(adjacent point)
1. ro no
1.1 (vertex ) o ( edge ) o
1.2 (loop) o ( multigraph edges) (simple graph)
(multigraph) (adjacent) o
2.
orooo o}
o 2 nn}ooo
3.
o
4. o
o
1
1. oo 2 n

G o 2
1. n}n ( vertex ) or V(G)
2. o ( edge ) nor E(G)

11

2. oo 3 no

on 2 onnn o (multigraph edges)


o (parallel edges) on (loop)
3. oonoo
oo 2 o 3 n o (parallel edges)
(loop) n
2
4. n}n n 3 4 o 4

U V } ( adjacent vertices ) n o
n
o e ( incident ) V o V }o
e
5. of 2.1 o 57 o r n 2
3
6. o o 5

1. n no n ( simple graph )
2. o n ( multi graph )
7. no on o
o noo{
onoo{no

12

5. no o o r n 2 e 5
6.

1. oo
2. o
3. o

x
1.
2.
x

r
x no 90%

1.
2.
x

1. no 90%
2. no 90%
x n 90%

7.
.
.
.
.
.
.
.

8.
.
.
.
.
.
.
.
..

13

o 2

G o 2
1. n}n ( vertex ) orV(G)
2. o ( edge ) nor E(G)

V (G ) z I

n E(G) }no

n 2.1 G
D

e1

e4

e3

e2

G o on
V(G) = { A , B , C , D }
E(G) = { e1 , e2 , e3 , e4 }
:
1. n no
o}ooo}no n n n}

e1

D
B

e5
A

e2

e4

e4
D

e2

e1

e3
B

e3

e5

14

2. oo o o nn}
n
B

nno o
B

e3

a
e1

e5

e2
c

e4

2
2 n e1 e2 }onn a c
o e3 }o b
n 2.2 o G }o V = { A , B , C , D , E } nn
} V E = { AB , AC , AD , BC ,DE } G }
A

15

n 2.3 G o V = { u , v , w , x , y , z }
o E = { uw , uz , vw , wx , wy , wz , xz , yz }
oo G o
v

n 2.4 on o

5
u
l5
v

l4

l2

l1
2

l3

{ u , v , w , z }
o { uu , uz , vz , zw }
{ 1 , 2 , 3 , 4 , 5 } o { l1 , l2 , l3 , l4 ,

l5 }

oo
1. n AB }nn}n AB BA (
n )
2. E n o o n AB n o AB o AB
BC n o BC o BC
3. n n n}n o

16

o 3
o

on 2 onnn o ( multiple edges )


o ( parallel edges ) on ( loop )
2

e3

a
e1

e5

e2
c

e4

n o e1 e2 }o o e5 }
n o or AB on
A B n n 2.1 o 2 o E ( G )
on} E ( G ) = { AB , AC , BC , BD }
n 2.5 nn 4 n A , B , C D o 4 , ,
nnn

n A
n A , B D
n C D
n A B
ooo non
n 1 n

17

{o G
V ( G ) = { A , B , C , D , , , , }
E ( G ) = { A , A , B , D , C , D , A , B }
G o

3
oo}
n A
n D
n C
n B
n 2.6 6 r
r n
r
r
r

r
r

o 3 on
{o o on

18

4
nr
no nr rr
o
no
o 2 on
( 2)

( 3)

r
( 1)

r
( 1)

( 2)

( 3)

n }

1
2
3

r
r

6 o 3

n 2.7 o

A
D
B

19

20

o 4

u v } ( adjacent vertices ) no
n
o e ( incident ) V o V }o
e
n 2.8
a
e
b

n
a b }

a d }

b c }

c d }

c e }

a e n}

a c n}
n
o a ab ad

o b ba bc

o c cb , ce ed o b da dc
o e ec

21

o 5

x n no n ( simple graph )
x o n ( multi graph )
n 2.9 n n}
A
_

B_B

(1)

( 2)

A
B

C_C

D
_
D

J
G

( 3)

( 4)

B
A

o ( 1 ) }
o ( 2 ) }
o
o ( 3 ) }
o
o ( 4 ) }

D
C

on A B
n n 2 oo
n n 2 oo
D

22

n 2.10 n G1 , G2 , G3 G4 no 5 o 8 o

G1 }

G2 }n
G3 }no
G4 }o

A
A
E

G1

G2

A
E

A
E

B
D

G3

G4

23

o 3
o ()
r

e 5
2

o
ooo ( degree ) o
on ( even point ) ( odd point )
1. ro
1.1 ( degree ) o
1.2 n ( even point ) ( odd point )o
2.
o (degree) oon
( even point ) ( odd point ) roo
{ o
3.
3.1 ( degree )
3.2 n ( even point ) ( odd point )
4. o
o
4.1 o o{ 10
1) nn}n n n 4 5
2) 1 no o{
o oo{
- {
- o on
- no{n{nn
- { no oonon
noo }o

24

3) ono{o no
4) }o o nno{ o
oo{
5) onnno{
6) onnno{o
7) o nnno
o{ n onn
- o{o
- o{ oo{on
- o
{ on
- no
{
- }{n o{
4.2 on
4.3 {ooo
oo o
- oon o 5 nnon
- o on o o 5 o
5 no
- o{ oroo
r{ o o oon o
on on 2 n 2 }noo
oo{
4.4 o o o{ o
oon
4.5 n

o Vi }o ej nn Vi ( incident ) ej
ej Vi

25

n nn ( degree ) n n n n}o
n oor deg v v

nno

n 3.1

(1)

A n 3 o 3 o
deg A = 3

(2)

B n 2 o 2 o
deg B = 2

(3 )
C

C n 4 o 1 o 1
deg C = 4

26

n 3.2 n
E
D
A

A
B
C
D
E

n 2
n 3
n 1
n 3
n 3
= 2 + 3 + 1 + 3 + 3 = 12
o = 6

n 3.3 n

A
D

C
B

A n 2
B n 3
C n 3
D n 0
= 2 + 3 + 3 = 8
o = 4
n ( even point ) }n
( odd point ) }

27

n 3.4 nn}n }
E
H
C
F

G
B
D

}n
D n 2
F n 4
H n 2
G n 2

}
A n 1
B n 3
C n 3
E n 3

n 3.5 on 22

n o n o
nno

22 = 2n

n = 11
on o 11 o
n 3.6 o 15 o 3 4 n
3

o n } 3
( 3 )( 4 ) + 3n
nno
( 3 )( 4 ) + 3n = 2( 15 )

n =6
3 + 6 = 9

28

n 3.7 n}onn 4 1 , 1 , 2
3

n 4 n 1 , 1 , 2 3
1 + 1 + 2 + 3 = 7
} o
}non
}n
r o G }
o G n G }r on G }n
G }n
nn G k v1 , v2 , v3 , . . . , vk
n n u1 , u2 , u3 , . . . , un on
( deg v1 + deg v2 + deg v3 + . . . + deg vk) + (deg u1 + deg u2 + deg u3 + . . . + deg un ) = 2q
q o G
deg v1+deg v2+deg v3 + . . . + deg vk = 2q (deg u1+ deg u2+deg u3 + . . . +deg un )
deg u1 , deg u2 , deg u3 , . . . , deg un n}n
2q (deg u1+ deg u2+deg u3 + . . . +deg un ) }n
n 2q }n deg v1 + deg v2 + deg v3 + . . . + deg vk }n
n deg v1 , deg v2 , deg v3 , . . . , deg vk }
k o}n o deg v1 + deg v2 + deg v3 + . . . + deg vk
onn n
n 3.8 oon oon 23 }onnoon
noon 7 n

{n} o oon o
oon
on 23 n 7
} 23 } o
}n
}no oonn 7 n

29

n 3.9 n}on 5 3 n
3 1 2
1

{n} o o
n
5 3 , 3 , 3 , 2 , 4 on }
3 } o }n
}no 5 3 n
3 1 2 1

4.6 of 2.2 o 66 - 68 o r n 2
.
5. no o o r n 2 e 5
6.

1. oo

1.
2.

1.
2.

r
1. no 90%
2. no 90%

2. o

x n 90%

3. o

1.
2. {

7.
.........................................................................................................................................................................
.........................................................................................................................................................................
.........................................................................................................................................................................
8.
.........................................................................................................................................................................
.........................................................................................................................................................................
.........................................................................................................................................................................
.

30

1
{
{
o no{ r
n o
o nonon
oo

oo
oo
oo

oo
{ n o 5 nnon
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

31


________________________________
n ___________________________________
1. _______________________________
3. _______________________________
5. _______________________________

{
no
2. _____________________________
4. _____________________________

1. o{
1.1 o on
.
.
.
.
.
.
1.2 on{
.
.
.
.
.
.
2. o{
/ oo{ on
.
.
.
.
.
.

32

3. o{
oo{
.
.
.
.
.
.
.
.
.
.
.
.
4.
oo{ o
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

33

o 4
o ()
r

e 5
1

o
oo ( walk ) o
1. ro
( walk ) ( connected graph )
2.
on }o
n
3.
o u v }
u v ( u v walk ) o

u = u0 , e1 , u2 , e2 , u3 , e3 , . . . , un-1 , en , un = v
o u v no ei ui-1
ui i { 1 , 2 , . . . , n }
G n ( connected graph ) n u v
}n G u v
4. o
o
4.1 o
4.2 o o
4.3 oo

34

4.4 onn 4 5 nn o
o 4.2 n ooonn
n
4.5 n}oon
5. no
6.

1. oo

2. o
3. o

1. {
2.
o{
x
x no

r
1. no 90%
2. no 90%
x no 90%
x n 90%

7.
.
.
.
.
.
8.
.
.
.
.
.
.

35

o 6

o u v }
u v ( u v walk ) o
u = u0 , e1 , u2 , e2 , u3 , e3 , . . . , un-1 , en , un = v
o u v no ei ui-1
ui i { 1 , 2 , . . . , n }
n 4.1
B
e3

e1

C
e2
A

e4
e5

A , e1 , B , e3 , C , e4 , D
B , e2 , A , e1 , B , e3 , C , e4 , D
B , e 3 , C , e4 , D

} A D
} B D
} B D

n 4.2
e

b
d

a , ac , c , cd , d , df , f } a f
c

non o

36

G n ( connected graph ) n u v
}n G u v
n 4.3

d
(1)

e }

a
b

(2)
a

d
c

n}nn
b g (
nnn
non
n} )

37

o 5
o (r )
r

e 5
2

o
on o}r ( Eulerian graph ) n}r
o}r ( circuit )o
1. ro
1.1 ( circuit ) o
1.2 ono}r ( Eulerian graph )
2.
no{oo r
3.

( circuit ) on oo
}
r ( Euler circuit ) noo
r n r ( Eulerian graph )
4. o
o
4.1 n
G
A
8

B
7

5
6

C
3
D

1. A B
2. A C
3. A E
A B A 8 B A 1 E 7 B
A C A 1 E 2 D 3 C
A E A 1 E

38

4.2 r r ( Leonhard Euler ) }


r oo{n {rr ( Konigsberg Bridges
Problem ) }{n 7 rr no
n

{n }onn oo n ( n ) oo
nnn o oo
ro{n} onoo
o

C
B
D
{oo}{nono o
ooonno
nooo o
{rr }{on n
onon
4.3 o o
4.4 of 2.4 o 80 83 or
n 2 nor e 5
4.5 nfoo

39

5. / no o
6.

1. oo
2. o
3. o

1.
2.
1.
2.
x

1.
2.
1.
2.
x

r
1. no 90%
2. no 90%
x no 90%
x n 90%

7.
.
.
.
.
.

8.
.
.
.
.
.
.

40

o 7
r

( circuit ) o n oo}

r ( Euler circuit ) noo


r n r ( Eulerian graph )
: n r} n o u v }
nr onr u v } u v
n 5.1 n G }rn
v1
v2

v3

v4

v5
v6

G v2 , v3 , v5 , v6 , v4 , v5 , v2 , v4 , v3 , v1 , v2 }r
G }r
o rno r G n
1. v3 , v2 , v5 , v6 , v4 , v5 , v3 , v1 , v2 , v4 , v3
2. v6 , v5 , v3 , v1 , v2 , v4 , v3 , v2 , v5 , v4 , v6

41

n 5.2 nn}rn
C
D

no}rn on
o rn
n}ro
1. noo
2. nno
3. o}
oooo nn
o n o n n n r o
nn nro
r r ono
onno
nn oor oo
no
nnonn
o o
nnonon
nn oo}n
o o
n o
ono
n}oo}no
n o G }ro G o}n
o G } o G n}r
noo oonn n 5.2 n}r
A B }

42

on 5.2 oo oonr
}n
n 5.3 G }n
r

v1
v2

v3
v4

v9
v8
v7

v5
v6

1. o I G n o v1 }oo C1 o
v1 , v2 , v5 , v6 , v7 , v3 , v1
2. n C1 noon on C1 o
nn C1 n v3 o P1 o
v3 , v2 , v4 , v9 , v8 , v4 , v3 P1 }
3. P1 n C1 o C2 o v1 , v2 , v5 , v6 ,

v7 , v3 , v2 , v4 , v9 , v8 , v4 , v3 , v1
4. n C2 noon onoo P2
v4 }o o v4 nn C2 o P2 o
v4 , v5 , v7 , v4
5. o C3 P2 n C2 oo v1 ,
v2 , v5 , v6 , v7 , v3 , v2 , v4 , v9 , v8 , v4 , v5 , v7 , v4 , v3 , v1 C3 }r
G }n oroo
or G n 5.3

43

o G }
G }r n G }n
ono}rnon
n 5.4 n G1 , G2 G3 }rn o} r
v1

G1 :
v4

v2

v5

v3

v1

G2 :

v4
v5

v2

v3

v1

G3 :

v5

v6

v4

v2
v3

G1 } r G1 }n r
o v1 , v2 , v3 , v5 , v3 , v4 , v1 , v5 , v1
G2 n}r v2 deg v2 = 3
G3 n}r G3 n}

44

n 5.5 oon }o nono


oo }onooon
n no

{}o A , B , C , D , E o A , B , C , D , E
o O o ono no n
oooo G

D
A

B
O

n G B , D , E O }
G n}r
nooo
nn oo

45

o 6
o ( r )
r

e 5
4

o
oo{o
1. ro
o o ro{o
2.
ro{
3.

n ( weight ) o e n} oo
e n ( weighted graph ) oon

( path ) n
A Z n A Z
noo A Z o

( cycle ) n ooo
oo ( tree ) n

46

n ( subgraph ) G oo G
n H }n G o V ( H ) V( G ) E( H ) E( G )

oon ( spanning tree ) oo}n G


G

oono ( minimal spanning tree ) oon n


noo

4. o
o
4.1 o oo{
4.2 oo 8 o 9 o
4.3 o 8 o 9 of 2.5 o 1

4.4 oon 4 5 o 10 o 11
4.5 onno n
4.6 oon 4 5 o 12 o 13
4.7 no 12 o 13
4.8 o f 2.5 o 2
4.9 o f
5. / no o f

47

6.

1. oo
2. o
3. o

1.
2.
x

1.
2.
x

r
x no 90%
x no 90%
x n 90%

7.
.....
.....
.....
.....
.....
.....
.....
.....
.....

8.
.....
.....
.....
.....
.....
.....
.....
.....
.....

48

o 8

n ( weight ) o e n} oo
e
n ( weighted graph ) o on

n 6.1

C
3

4
3

5
D
6

oon n n o
n n

49

o 9

( path ) n
A Z n A Z n
oo A Z o
n 6.2 n

C
4

3
A
1

E
7
1
6

F 2

3
B

o o n on
( n ) o A B n
n nn onno

no A B nn
o 1 A , C , E , B
A B 3 + 4 + 3 = 10
o 2 A , C , E , F , B
A B 3 + 4 + 1 + 2 = 10
o 3 A , D , E , B
A B 1 + 7 + 3 = 11
o 4 A , D , E , F , B
A B 1 + 7 + 1 + 2 = 11
o 5 A , D , F , B
A B 1 + 6 + 2 = 9
o 6 A , D , F , E , B
A B 1 + 6 + 1 + 3 = 11
o 5 n
o 5 A , D , F , B A B n 9
} n

50

o 10

( cycle ) n o oo
oo ( tree ) n
n 6.3 G
g
b
f

a
c
d

n G }n
G }oo
n 6.4 G

b
a

d
c
e

n G a , b , c , a
G n}oo

51

o 11

n ( subgraph ) G oo G n
H }n G o V ( H ) V( G ) E( H ) E( G )

n 6.5 G H
c
b
d
G
a
e

b
H
e

a
f

V( G ) = { a , b , c , d , e , f }
E( G ) = { ab , af , bf , bc , cd , fd , fe , ed }
V( H ) = { a , b , e , f }
E( G ) = { ab , bf , fe }
n V( H ) V( G ) E( H ) E( G )
H }n G

52

o 12

oon ( spanning tree ) oo}n G


G
n 6.6 G
c

a
G

b
d

oon G on H1 , H2 , H3 , H4 , H5 , H6 , H7 , H8
a

H1

H2
b

d
a

H3

H4
b

d
a

H5

H6
b

b
d
a

c
a

H7

H8
b
d

b
d

o 13

oono ( minimal spanning tree ) oon n


noo
n 6.7 n oono
c

d
2
1

oon o
c

H1
1

no H1 1 + 1 + 1 = 3
c

H2
2
1

no H2 1 + 2 + 1 = 4
c

H3
2
1

no H 3 1 + 2 + 1 = 4
H1 }oono

53

54

oon o oo n on
no oonono
n 6.7 n oono
n 6.8 n oon o
a
5
e

6
4

3
c

8
f

1 o o o cd n 3

a
5

6
4

3
c

8
f

2 o oono o
ac ef n 4 n o cd , ac ef n}
a
5

6
3
c

d
8

n n 2 ooon

55

3 o n 5 o ea cf oo o
oo ea
a
5

6
4

3
c

8
f

4 o n 6 o ab

a
5

6
3
c

d
8

1 4 oo on o noono
3 + 4 + 4 + 5 + 6 = 22

56

o
:
.

..
.n r
.
o :

o
o
oo

o :
r r
o
.
rr
r
roron n
x n

x r
r
x
r
x o

o :
r

o :
o
r
r
:
o
r
n :
{
:
r

on oo
n
n

You might also like