Revision history [back]

Input: Two undirected simple graphs G1 and G2, each having n vertices. Output: True if G1 ? = G2; False otherwise.

1 for i ? 1,2 do 2 Ai ? adjacency matrix of Gi 3 pi ? permutation equivalence class of Ai 4 A0 i ? lexicographically maximal element of pi 5 if A0 1 = A0 2 then 6 return True 7 return False

anyone have any idea how to implement this in Sage ?

Input: Two undirected simple graphs G1 and G2, each having n vertices. Output: True True if G1 ? = G2; False False otherwise.

for i ? 1,2 do
2   Ai ? adjacency matrix of Gi
3   pi ? permutation equivalence class of Ai
4   A0 i ? lexicographically maximal element of pi
5 if A0 1 = A0 2 then
6   return True
7 return False
False

Input: Two undirected simple graphs G1 and G2, each having n vertices. Output: True if G1 ? = G2; False otherwise.

for i ? 1,2 do
  Ai ? adjacency matrix of Gi
  pi ? permutation equivalence class of Ai
  A0 i ? lexicographically maximal element of pi
if A0 1 = A0 2 then
  return True
return False

anyone have any idea how to implement this in Sage ?

Input: Two undirected simple graphs G1 and G2, each having n vertices. Output: True if G1 ? = G2; False otherwise.

for i ? 1,2 do
  Ai ? adjacency matrix of Gi
  pi ? permutation equivalence class of Ai
  A0 i ? lexicographically maximal element of pi
if A0 1 = A0 2 then
  return True
return False

anyone have any idea how to implement this in Sage ?