Given an (undirected) graph G, is there way to (approximately) estimate the order of Aut(G)-- i.e., the number of permutations with the same adjacency matrix (up to permutation)?
How about the orbits?
Is there any literature on computational algebraic graph theory that can be helpful here?