三重 大 学 教 育 学 部 研 究紀 要 第5 9 巻 自 然 科 学 (2 0 0 8) 1 ‑ 2 3 貞
初 等 力 学 グ ラ フ の 構 造
蟹 江 幸 博*
Str u ctur e s or E le ‑ e nta rア D yn a m ic al G r ap hs
Y uk i h ir o K A N I E
C o nte n ts
§1・ Brier R e view sof F inite D ァna m ic al G r ap hs
§1 ‥1 C ycle s a nd in v e rti b le D G
§1 ‥2 D egr e e sa nd S iz e a nd Pe riod C ha r a cte risitc
§1 ‥3 A tta ch ing
§1・・4 p‑m a ry Ps e udo‑tr e e
§2. Re al i21 atio n of D yn am ic al G r ap hs
§2 ‥1 S h ifts a nf Exte n sio n
§2 ‥2 E le m e nta rァ D G
§3・ Fa cts fr om E lem e nta ry N um be r T he o ry
§3 ‥1 T he G r o up of Redu c ed R e si du e C la s s e s
§3 ‥2 (〕uadr atic Re si du e s
§4. A d d itio n G r ap h A言
§5・ M ulti plic atio n Gr ap h Mf
§5 ‑1 Ca s e ofk ‑ p: prim e
§5 ‥2 Ca s e ofk ‑2m(m , 0)
§5・ ・3 Ca s e of k = p
2(p: od d prim e)
§5・ ・4 Ca s e ofk = pm(m , 0,p=prim e)
§5・ ・5 Ca s e of Com po site Num be r sk
§5 ‥6 M is c el la r l e O u S Ca s e s
2 3 4 4 5
5 6 6
6 6 8
8
9 1 3 1 5 1 7 1 8 2 1 2 3
Intr o d u ctio n
I pr opo s ed the c o n c ept of dァn a m ic al gr aphsfらr C linic al M athe m atic s E du c atio n in [2], a nd d is c u s s ed
their m athe m atic althe o ry in the c a s e ofr edu c ed divis o r s u m sin[3], a nd in the c a s e ofr e v e r s ed diffe r e n c e s
in [5]・ A nd in [8], Id ete r min ed the n u m be r orthe is o m o rp his m cla s s e s of dyn a mic al gr ap hs with v e rte x n u m be rk ≦10・ T he r e w e kn o w the str u ctu r e s of d ym a mic al gr ap hs a r e r athe r c o m p lic ated e v e n in s u ch
a s m all siz e c a s e.
In th is n ote, w e will d e s c ribe s o m e str u ctu r e s or ba sic ele m e nta rァ dァn a mic al gr aph s, e spe ciall y or
ad d itio n gr aphs a nd m ultip lic atio n gr aphs・ W e u s e s o m tim e sthe ab b r e viatio n D G fo r d yn a mic al gr aphs・
*
・M ath・D ept・ of Fa c・ of E d ・,M ie U nive r s lty
§1 ・ B rief R e vie w s of F ini te D y n a m ic al G r ap h s
L et V b e a finite s et・ A dyn a mic al graph a ‑(V ,E)is an oriented graph on V w ho s e every vertex v ∈V ha s o nly one o ut going edge from v
, thatis
, th ere is o nly one vetex w with (v, w) ∈ E ・ A n oriented edge
(v, w) ∈E is s o m etim e s draw n a s ′u ‑ w and is c alled a n ar ro w .
Denote by D(V) the set of all d yn amic al graphs on V , which is bije ctive to the s et M ap(V,V) ofth e
m aps of V toi ts elf・ T he c or re spondenc eis gl Ven a S follows.
G ive n f ∈ M ap(V,V), take the graph E(I) ‑((v,f(v)) I v ∈ V) of the m apf a sthe s et of edge s of G,
then G(f) ‑ (V, E(I))is a dyn amic al gr aph .
C on vers ely, given a d yn a mic al graph a ‑ (V,E) on V , fo r any v E V w e have only o n e vertex w E V
with(v,w) ∈ E ・ So let I(v) ‑ w ・ D enot ing f byf(a), w e get that G ‑ a(f(G)) a nd f ‑ f(G(I))・
T w o m aps f ∈ M ap(V ,V) and a ∈ M ap(W , W) are c alled is o m o rphic, ifth ere exists a bije ctio n p : V ‑ W (c alled an is o m o rphis m) s atisfying the equ alit y
p o f ‑ 9 0 P ⇔f ‑ p‑1 o g o p .
T h en w e w ri te a s f 空 g, and c allthed yna mical gr aphs a(I) and G(g) areis o m o rphic wi th e a ch other and den oted by G(f) 空 G(g)・
In de s cribin t ,o
'
stru ctu r e s explicitely, there are s o m e c a s e s whe r eitisim porta nt to spe cifylab els of verte c e s, a nd to dist inguish is o m orph ic D G's. S o w e de n ote p *f ‑.p 。f 。 p
1 a nd p * G(I) ‑ a(p *f), and c all
ア* G(f) the ダーtr a nSfer of the D G a(f )・ T hen we s ay t・hat the D G G(f) on V is p ‑tra n sfered t・o the D G
・ア* G(f) on 14'・ M ore over, if G′is a D S G of G ,t・hen p * G′is als o a D S G of p * G(I ).
If f is bije ctive, th e d yn a mic al graph G(f 1) defined by thein vers e m ap p ing r l is c alled t,he inve r s e
graph of G ‑ G(f), and G is c alled in ve rtible. W rite G 1 ‑ G(f 1)for the invers e of G , the n i t c an be
obtained by reversl ng all dire cti・o n s of ar row s of C
D e n ote h y 7)「 V lt・he s et・ of al一 dv na・n ljc al gr f l,Phs o n V , a nd hv 7)′「Vl the s et of allin v e rtihle dv n a・mic alr
\ / tノ \ ′
graphs on V I T h e c ardinali t y of V is c alled of siz e of G ‑ (V, E), denoted by s ‑ s(G), w hich c oincide s
with the nu m ber # E of edge s of a .
D en ote by か(v) a,nd D
′
(v) the s et of is o m o rph is m cla s s e s of 了)(V) and D ′(V) r e spe ctively. Now w e prepa r e s o m e ba sic n otio n s abo ut D G .
L et G ‑(V .E) ‑ G(I) be a D G ・ A dyn a m ic algraph G ' ‑ (V ',E)' is c alled dyn a mic als ubgraph(D S G)
of G, if V ' c v , E ' c E and every edgein E ' c onsists of verte c e s in V'.
For a vertex ,u ∈ V , the s et of all'd e s c e nda nts' of v:
V +(i), ‑ †w ∈ V F w ‑ fa(v)for s o m e a >̲ 0)
is a D S G by.u al ld is c all, ed thefutu r e of v. T his s ubgraph is the minim al s ubgr aph c o ntaining the ve rtex v, s oi t is als o c alled the s ub graph gen erated byru a nd is denoted by(v). For any s ubs et U ⊂ V, den ote by
(U) the D G gen erated by U .
For a vertex u ∈ V ,the s et of all ‑anc e sterts' of 1) :
V‑(u) ‑ ( w ∈ V 卜L7 ‑ fa(w)fors o m e a ≧0)
is called th e past of u. butit is llOt a D S G in ge n eral.
Fo r an integer n,≧0・d enoteby G(",) the subgraph G(flfれ(V)) ‑ (fn(V)) o n t・h eI‑inva riant subs etfn(V),
a nd c all it the n‑thfutur e gr aph. A ls o den ote G (1) ‑ G ',and c alli t the de riv ed gr aph of G . T he n w e get
v ‑ fO(v)∋fl(v)⊇・ ・・∋fh(v) ‑ fh + 1(v) ‑
‑ 2 ‑