The 1-good neighbor connectivity of unidirectional star graph networks

Abstract

Unidirectional star graphs, the star graph interconnection networks with simplex unidirectional links, can be used in the area of parallel and distributed computing. The 1-good-in-neighbor connectivity, the 1-good-out-neighbor connectivity, and the 1-good-neighbor connectivity are more accurate network reliability indices than the classical connectivity. In this paper, we first give lower bounds on the cardinalities of the out-neighborhood and the in-neighborhood of a vertex subset of a unidirectional star graph and then determine the 1-good-in-neighbor connectivity, the 1-good-out-neighbor connectivity, and the 1-good-neighbor connectivity of unidirectional star graphs.