Title: | Distance-regular Cayley graphs on dihedral groups |
---|
Authors: | ID Miklavič, Štefko (Author) ID Potočnik, Primož (Author) |
Files: | http://dx.doi.org/10.1016/j.jctb.2006.03.003
|
---|
Language: | English |
---|
Work type: | Not categorized |
---|
Typology: | 1.01 - Original Scientific Article |
---|
Organization: | IAM - Andrej Marušič Institute
|
---|
Abstract: | The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every non-trivial distance-regular Cayley graph on a dihedral group is bipartite, non-antipodal, has diameter 3 and arises either from a cyclic di#erence set, or possibly (if any such exists) from a dihedral difference set satisfying some additional conditions. Finally, all distance-transitive Cayley graphs on dihedral groups are determined. It transpires that a Cayley graph on a dihedral group is distance-transitive if and only if it is trivial, or isomorphic to the incidence or to the non-incidence graph of a projective space ▫$\mathrm{PG}_{d-1} (d,q)$▫, ▫$d \ge 2$▫, or the unique pair of complementary symmetric designs on 11 vertices. |
---|
Keywords: | mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set |
---|
Year of publishing: | 2007 |
---|
Number of pages: | str. 14-33 |
---|
Numbering: | Vol. 97, no. 1 |
---|
PID: | 20.500.12556/RUP-2594 |
---|
ISSN: | 0095-8956 |
---|
UDC: | 519.17 |
---|
COBISS.SI-ID: | 1909207 |
---|
Publication date in RUP: | 15.10.2013 |
---|
Views: | 3605 |
---|
Downloads: | 100 |
---|
Metadata: | |
---|
:
|
Copy citation |
---|
| | | Average score: | (0 votes) |
---|
Your score: | Voting is allowed only for logged in users. |
---|
Share: | |
---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |