Login / Signup

There is no upper bound for the diameter of the commuting graph of a finite group.

Michael GiudiciChris Parker
Published in: J. Comb. Theory, Ser. A (2013)
Keyphrases
  • random graphs
  • upper bound
  • graph theoretic
  • lower bound
  • branch and bound
  • branch and bound algorithm
  • finite number
  • lower and upper bounds
  • worst case
  • group members
  • objective function
  • graph theory
  • spanning tree