𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite edge-transitive dihedrant graphs

✍ Scribed by Jiangmin Pan; Xue Yu; Hua Zhang; Zhaohong Huang

Book ID
113567503
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
247 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-transitive planar graphs
Edge-transitive planar graphs
✍ Branko GrΓΌnbaum; G. C. Shephard πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 590 KB
Graphs on which a dihedral group acts ed
Graphs on which a dihedral group acts edge-transitively
✍ Robin Sue Sanders πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 528 KB

In the present paper we find all the graphs on which a dihedral group acts edge-transitively. First we explicitly build the permissible permutation representations of the dihedral group. Then we use this knowledge to find all the graphs on which a dihedral group acts edge-transitively. These graph

Random walks on edge transitive graphs
Random walks on edge transitive graphs
✍ JosΓ©Luis Palacios; JosΓ©Miguel Renom πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 337 KB

We find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending prior results and allowing the computation of sharp upper and lower bounds for the expected cover times of those graphs.