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 |