generateRandomGraphs -- generates random graphs on a given number of vertices

Synopsis

• Usage:

  G = generateRandomGraphs(n, num)

  G = generateRandomGraphs(n, num, pq)

  G = generateRandomGraphs(n, num, pz)

  G = generateRandomGraphs(R, num)

  G = generateRandomGraphs(R, num, pq)

  G = generateRandomGraphs(R, num, pz)

• Inputs:
  • R, a polynomial ring, the ring in which the graphs will be created
  • n, an integer, the number of vertices of the graphs, must be positive (see caveat)
  • num, an integer, the number of random graphs to generate
  • pq, a rational number, the edge probability (between 0 and 1)
  • pq, a real number, the edge probability (between 0 and 1)
  • pz, an integer, the reciprocal of the edge probability (positive)
• Optional inputs:
  • RandomSeed => an integer, default value null, the specified random seed is passed to nauty
• Outputs:
  • G, a list, the randomly generated graphs

Description

i1 : generateRandomGraphs(5, 5, RandomSeed => 314159)

o1 = {DEK, DbO, D[O, DiO, DMg}

o1 : List

i2 : generateRandomGraphs(5, 5)

o2 = {Dv[, DVG, D{w, DLG, DR?}

o2 : List

i3 : generateRandomGraphs(5, 5, RandomSeed => 314159)

o3 = {DEK, DbO, D[O, DiO, DMg}

o3 : List

Caveat

See also

• Example: Generating and filtering graphs
• generateRandomRegularGraphs -- generates random regular graphs on a given number of vertices