A graph theoretic approach in achieving robust peer-to-peer networking paradigm

Abstract

In this paper, we proposed a graph theoretic approach employing an algorithmic method to construct constant-degree graphs possessing not only provably minimum diameter, but also maximum connectivity with respect to other similar graphs.