Michael Edwin Raines

Learn More
A permutation graph G π of a graph G (or generalized prism) is obtained by taking two disjoint copies of G and adding an arbitrary matching between the copies. For the parameters diameter, radius, average distance, connectivity and edge-connectivity, we compare the values of the parameter for G π and G. In particular we show that if G has no isolates and is(More)
  • 1