Ask Your Question

Mohab's profile - activity

2020-06-09 15:15:49 -0600 received badge  Popular Question (source)
2019-06-26 07:03:31 -0600 received badge  Popular Question (source)
2017-01-04 20:45:42 -0600 received badge  Student (source)
2013-04-07 07:24:14 -0600 asked a question Distinct (nonisomorphic) trees

"Construct all non-isomorphic trees of order 7"

How to do that in Sage ?! Please help

2013-04-07 07:20:20 -0600 received badge  Supporter (source)
2013-03-14 00:22:04 -0600 asked a question Algorithm implementation 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 ?