
[圖論] isomorphic

總覺得答案是E
Graphs G and H are said to be isomorphic
if there exist a bijection f:V(G)->V(H)
such that if {a,b} in E(G) then {f(a),f(b)} in E(G)
所以
f
A -> E
B -> G
C -> F
D -> H
I跟II應該是isomorphic
到底是我哪裡不通還是解答有錯@.@?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 1.172.61.122
→
10/13 17:01, , 1F
10/13 17:01, 1F