Lattice representation of Complete Graph and Perfect Difference Network (PDN)

Abstract

In this paper we have evaluated the links of Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ+1) nodes in order to derive a relation which gives us the total number of disjoint lattices formed in a Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ +1) nodes. In this paper we have also seen that the smallest lattice formed in a Complete Graph and PDN of (δ2+δ+1) includes only three nodes and the biggest lattice formed in a Complete Graph and PDN includes all the nodes of the Complete Graph and PDN i.e. (δ2 + δ+1) nodes. In this paper we have also seen the effect of removal of diagonal links in the Perfect Difference Network in lattice formation.