Design of interconnection networks for processor organization requires a comprehensive knowledge of implicit topological properties inherited by these networks. The architecture of novel interconnection networks is defined by its polylogrithmic time using polynomial number of processors. An undirected graph with processors as nodes and links between the processors as an edge represents a graphical model for interconnection networks with the assumption of the relation that processors are connected with a polynomial in polylogrithmic time. Star Graph, hypercube and a recently developed perfect difference network are popular interconnection networks of interest to researchers with principal to have efficient use of processors in minimal time with minimal connectivity. We restrict our attention to study and compare these interconnection networks topological properties. To measure the combinatorial properties of the compared interconnection networks, we had defined mapping function to map data according to the topology of the interconnection network.