Orienting Cayley graphs generated by transposition trees

Authors:
Eddie Cheng;László Lipták;Nart Shawash
Affiliations:
Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA;Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA;Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 7
Cited 2

Uni-directional hypercubes

Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Unidirectional star graphs

Information Processing Letters
Vertex-symmetric digraphs with small diameter

Discrete Applied Mathematics
On the Day—Tripathi orientation of the star graphs: connectivity

Information Processing Letters
Uni-directional Alternating Group Graphs

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Maximal vertex-connectivity of $\overrightarrow{S_{n,k}}$

Networks
Hyper hamiltonian laceability of Cayley graphs generated by transpositions

Networks

Conditional connectivity of Cayley graphs generated by transposition trees

Information Processing Letters
Conditional connectivity of star graph networks under embedding restriction

Information Sciences: an International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

Day and Tripathi [K. Day, A. Tripathi, Unidirectional star graphs, Inform. Process. Lett. 45 (1993) 123-129] proposed an assignment of directions on the star graphs and derived attractive properties for the resulting directed graphs. Cheng and Lipman [E. Cheng, M.J. Lipman, On the Day-Tripathi orientation of the star graphs: Connectivity, Inform. Process. Lett. 73 (2000) 5-10; E. Cheng, M.J. Lipman, Connectivity properties of unidirectional star graphs, Congr. Numer. 150 (2001) 33-42] studied the connectivity properties of these unidirectional star graphs. The class of star graphs is a special case of Cayley graphs generated by transposition trees. In this paper, we give directions on these graphs and study the connectivity properties of the resulting unidirectional graphs.