Comprehensive study of complete graph and Perfect Difference Network (PDN)

Abstract

In this paper, we have explored the graph properties of PDN and Complete Graph of (δ²+ δ+l) node networks to make the complete traversal of the perfect different network (PDN). We have also showed the diagonal links of PDN through its adjacency matrix. In this paper, we have also calculated the density for Hypercube, PDN, and Complete Graph architectures by manipulating the edges of these architectures. The symmetry in Complete Graph of (δ²+ δ+1) nodes is seen on the repetition of edges in different circuits. In this paper, we have also seen that on the removal of chordal ring links in Complete Graph the circuits removed are getting successively decreased.