Upper bounds on the automorphism group of a graph (Q1849961): Difference between revisions

This article presents some upper bounds on the order of the automorphisms of a simple graph \(G\). Theorem 1 gives a simple, but interesting result about the upper bound on \(\Aut(G)\). Theorem 2 summarizes some results about the cardinality of \(\Aut(G)\) for particular graphs \(G\). By using the greedy spanning tree notion, another bound on \(\Aut(G)\) is derived in Theorem 3.