Skip to content

Abstract

This research focuses on proving the pseudonofinity of (n, k)-star graphs, a class of interconnection networks. We aim to establish the conditions under which these graphs exhibit infinite behavior, contributing to the understanding of their scalability and robustness in network topologies. The results will have potential applications in parallel computing and communication systems.

Keywords

(n, k)-star graphsPseudonofinityInterconnection networksGraph theoryScalabilityNetwork topologiesParallel computingCommunication systemsCombinatorial propertiesInfinite graph sequencesApproxmination theory