Peer-to-peer networks based on random transformations of connected regular undirected graphs

We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached

• Type: Conference
• Year: 2005
• Where: SPAA
• Authors: Peter Mahlmann, Christian Schindelhauer
• Keywords: Distributed And Parallel Computing, Graph Transformation Algorithm, Operation Preserves Regularity, Regular Undirected Graphs, SPAA 2005