| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653813 | European Journal of Combinatorics | 2012 | 25 Pages |
Abstract
⺠We study G-symmetric graphs Î whose normal quotients are complete or empty. ⺠We show that each G corresponds to a finite transitive linear group H. ⺠We construct all (Î,G) with at least 3 complete quotients, for Hâ¤ÎL(1,q). ⺠We determine which of the graphs constructed have diameter 2.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carmen Amarra, Michael Giudici, Cheryl E. Praeger,