isomorphic graphs 中文意思是什麼
-
Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.
如果在兩個圖之間存在一個保持鄰接性的1-1對應，則這兩個圖是同構的。 -
We may thereby compute the number of graphs which are isomorphic to their complements.
因此我們可以計算同構于其補的圖的數目。 -
To show that two graphs are isomorphic one must indicate an isomorphism between them.
要證明兩個圖是同構的，就必須指出它們之間的一個同構。 -
Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency
如果在兩個圖之間存在一個保持鄰接性的1 - 1對應，則這兩個圖是同構的。 -
With this method, in the present thesis, we will classify all the connected regular covering graphs of the cube satisfying the following two properties : ( 1 ) the covering transformation group is isomorphic to the elementary abelian p - group ; ( 2 ) the group of fibre - preserving automorphisms acts edge - transitively
本文中，我們用同一種方法分類立方體的正則連通覆蓋圖，並且滿足兩個條件，覆蓋變換群同構于初等交換p -群且保纖維自同構群是邊傳遞的。 -
After all the eigenvalues have been considered, isomorphism will be determined and correspondence of vertices in isomorphic graphs can be ultimately identified
通過逐一考查全體特徵值，實現圖同構的判定並確定同構圖的頂點對應關系。
分享友人