학술논문
Structure, automorphisms, and isomorphisms of regular combinatorial objects.
Document Type
Theses
Author
Source
Dissertation Abstracts International; Dissertation Abstract International; 78-03B(E).
Subject
Language
English
Abstract
Summary: As a consequence of the combinatorial structure underlying our bounds for the automorphism groups, we give corresponding bounds for the time-complexity of deciding isomorphism. When we bound the order of the automorphism group, our time-complexity bounds are identical to the bounds on the order. From our study of the composition factors of automorphism groups of strongly regular graphs, we obtain a vmu+O(log v) and a exp( O (v1/5)) bound on the time-complexity of deciding isomorphism of strongly regular graphs.