Node bisectors of Cayley graphs

Theory of Computing Systems

Volumn 29, Issue 6, 1996, Pages 589-598

  Blackburn, S R ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GROUP THEORY;

ABELIAN GROUP; CARDINALITIES; CAYLEY GRAPHS; GENERATING SET; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 8744236045     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01301966     Document Type: Article

References (5)

1. S.B. Akers and B. Krishnamuthy. A Group-Theoretic Model for Symmetric Interconnection Networks. IEEE Transactions on Computers, C-38 (1989), 555-566.
2. D. Aldous. On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing. Probability in Engineering and Informational Sciences, 1 (1987), 33-46.
3. F. Annexstein and M. Baumslag. On the Diameter and Bisector Size of Cayley Graphs. Mathematical Systems Theory, 26 (1993), 271-291.
4. L. Babai. Local Expansion of Vertex Transitive Graphs and Random Generation in Finite Groups. Proceedings of the 23rd ACM Symposium on the Theory of Computing, (1991), 164-174.
5. G. E. Carlsson, J. E. Cruthirds, H. B. Sexton, and C. G. Wright. Interconnection Networks Based on a Generalization of Cube Connected Cycles. IEEE Transactions on Computers, 34 (1985), 769-772.