Upper bounds on the automorphism group of a graph (Q1849961): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the automorphism group of a graph |
scientific article |
Statements
Upper bounds on the automorphism group of a graph (English)
0 references
2 December 2002
0 references
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.
0 references
