vertexMultiplication

Synopsis

• Usage:

  H = vertexMultiplication (G, v, u)

• Inputs:
  • G, an instance of the type Graph,
  • u, a thing, u is the new vertex to be added
  • v, a thing, v is the vertex whose neighbors become the vertices that u connects to.
• Outputs:
  • H, an instance of the type Graph,

Description

i1 : G = completeGraph 5

o1 = Graph{0 => {1, 2, 3, 4}}
           1 => {0, 2, 3, 4}
           2 => {0, 1, 3, 4}
           3 => {0, 1, 2, 4}
           4 => {0, 1, 2, 3}

o1 : Graph

i2 : H = vertexMultiplication(G, 0, 6)

o2 = Graph{0 => {1, 2, 3, 4}   }
           1 => {0, 2, 3, 4, 6}
           2 => {0, 1, 3, 4, 6}
           3 => {0, 1, 2, 4, 6}
           4 => {0, 1, 2, 3, 6}
           6 => {1, 2, 3, 4}

o2 : Graph