On the symmetries of some classes of recursive circulant graphs
A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $G(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. In this paper, we will find the automo...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2014-03-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=articleInfo&article=3818&vol=593 |
| _version_ | 1811264864696401920 |
|---|---|
| author | Seyed Morteza Mirafzal |
| author_facet | Seyed Morteza Mirafzal |
| author_sort | Seyed Morteza Mirafzal |
| collection | DOAJ |
| description | A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $G(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. In this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. In particular, wewill find that the automorphism group of $G(2^m; 4)$ is isomorphicwith the group $D_{2 cdot 2^m}$, the dihedral group of order $2^{m+1} |
| first_indexed | 2024-04-12T20:13:19Z |
| format | Article |
| id | doaj.art-0800f8349eed4c30900d50b331cf77d1 |
| institution | Directory Open Access Journal |
| issn | 2251-8657 2251-8665 |
| language | English |
| last_indexed | 2024-04-12T20:13:19Z |
| publishDate | 2014-03-01 |
| publisher | University of Isfahan |
| record_format | Article |
| series | Transactions on Combinatorics |
| spelling | doaj.art-0800f8349eed4c30900d50b331cf77d12022-12-22T03:18:12ZengUniversity of IsfahanTransactions on Combinatorics2251-86572251-86652014-03-013116On the symmetries of some classes of recursive circulant graphsSeyed Morteza MirafzalA recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $G(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. In this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. In particular, wewill find that the automorphism group of $G(2^m; 4)$ is isomorphicwith the group $D_{2 cdot 2^m}$, the dihedral group of order $2^{m+1}http://www.combinatorics.ir/?_action=articleInfo&article=3818&vol=593Cayley graphRecursive circulantAutomorphism groupDihedral group |
| spellingShingle | Seyed Morteza Mirafzal On the symmetries of some classes of recursive circulant graphs Transactions on Combinatorics Cayley graph Recursive circulant Automorphism group Dihedral group |
| title | On the symmetries of some classes of recursive circulant graphs |
| title_full | On the symmetries of some classes of recursive circulant graphs |
| title_fullStr | On the symmetries of some classes of recursive circulant graphs |
| title_full_unstemmed | On the symmetries of some classes of recursive circulant graphs |
| title_short | On the symmetries of some classes of recursive circulant graphs |
| title_sort | on the symmetries of some classes of recursive circulant graphs |
| topic | Cayley graph Recursive circulant Automorphism group Dihedral group |
| url | http://www.combinatorics.ir/?_action=articleInfo&article=3818&vol=593 |
| work_keys_str_mv | AT seyedmortezamirafzal onthesymmetriesofsomeclassesofrecursivecirculantgraphs |