ARCHITECTURAL RELATIONSHIP OF DIFFERENT HYPERSTAR NETWORKS: ARCHITECTURAL RELATIONSHIP OF DIFFERENT HYPERSTAR NETWORKS - Softcover

Inhaltsangabe

In this book, we have used the concept of graph theory to study the Architectural differences of different hyperstar networks (especially Complete Graph and a Perfect Difference Network). The complete circuit analysis of these architectures also shows the robustness of these architectures, and the evaluation of links of Complete Graph of (δ2+δ+1) with the edges of PDN we have derived a theorem of a primitive irreducible cubic belonging to a field GF(δn), which James Singer have suggested in (May, 1938) in his famous paper “A Theorem in Finite Projective Geometry and Some Applications to Number Theory”. In this book we have also calculated the factor (k) for Hypercube, PDN, and Complete Graph architectures by manipulating the edges, nodes, and diameter of these architectures which gives the connectivity of these architectures. After evaluating all these facts we found polynomials which suggest that PDN is P complete.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.