Atlas Mathematical Conference Abstracts || Conferences | Abstracts | for Organizers | About AMCA

Horizons in Combinatorics/16th Shanks Lecture Series
May 21-24, 2001
Vanderbilt University
Nashville, TN, USA

Organizers
Paul Edelman, Mark Ellingham, Jonathan Farley, Mike Plummer, Jerry Spinrad

View Abstracts
Conference Homepage

Counting Identity Graphs and Digraphs of Minimum Size
by
Robert W. Robinson
Department of Computer Science, University of Georgia, Athens, GA 30629

The number I(n) of nonisomorphic identity graphs of minimum size and order n is determined in a way that allows for efficient calculation. Here the order is the number of vertices and the size is the number of edges. An identity graph is one for which the identity is the only automorphism. The growth pattern of I(n) is sawtoothed; it takes the value 1 infinitely often but is unbounded. Similar results are obtained for the numbers of identity digraphs of minimum size.

Robert W. Robinson's home page

Date received: April 19, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cags-55.