On the diameter and bisector size of Cayley graphs

@article{Annexstein1993OnTD,
  title={On the diameter and bisector size of Cayley graphs},
  author={Fred S. Annexstein and Marc Baumslag},
  journal={Mathematical systems theory},
  year={1993},
  volume={26},
  pages={271-291}
}
We present bounds on two combinatorial properties of Cayley graphs in terms relating to the structure of their underlying group, Included in this work is a presentation of lower bounds on the diameter of Cayley graphs of groups with nilpotent subgroups and upper bounds on the size of node bisectors of Cayley graphs of groups with solvable subgroups. Cayley graphs, being endowed with algebraic structure, have been increasingly recognized as a source of interconnection networks underlying… CONTINUE READING

From This Paper

Topics from this paper.
11 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Processor-time tradeoffs for cayley graph interconnection networks

  • M. Baumslag, A. L. Rosenberg
  • Proc. 6th Distributed Memory Computing Conf.,
  • 1991

Discrete Groups , Expanding Graphs , and Invariant Measures

  • A. Lubotsky
  • 1990

Dense symmetric networks from linear groups and codes

  • L. Campbell, G. E. Carlsson, +5 authors H. B. Sexton
  • 1988
2 Excerpts

Group theory as an organizing principle in parallel processing

  • G. E. Carlsson, M. R. Fellows, H. B. Sexton, C. G. Wright
  • J. Combin. Theory Combin. Comput
  • 1988

Ramanujan graphs

  • P. Sarnak
  • Combinatoriea
  • 1988

Similar Papers

Loading similar papers…