Due to recent developments of parallel and distributed computing, the design and analysis
of various interconnection networks has been a main topic of research for the past few years …

The endomorphism monoids of graphs have been actively investigated. They are
convenient tools expressing asymmetries of the graphs. One of the most important classes of …

We present a new interconnection topology, called the arrangement graph, as a
generalization of the star graph topology and prove many of its properties such as …

Connectivity plays an important role in measuring the fault tolerance of interconnection
networks G=(V, E). A faulty set F⊆ V is called ag-extra faulty set if every component of G− F …

Suppose that G is a bipartite graph with its partite sets of equal size. G is said to be strongly
Hamiltonian‐laceable if there is a Hamiltonian path between every two vertices that belong …

A subset F⊂ V (G) is called an R2-vertex-cut of G if G− F is disconnected and each vertex
u∈ V (G)− F has at least two neighbors in G− F. The cardinality of a minimum R2-vertex-cut …

We study the cross product as a method for generating and analyzing interconnection
network topologies for multiprocessor systems. Consider two interconnection graphs G/sub …

We derive the fault-diameter of the star graph using a combinatorial method, thereby resting
the previously open question of finding the exact value for the fault diameter of the star …

The star graph interconnection network has been recognized as an attractive alternative to
the hypercube network. Previously, the star graph has been shown to contain a Hamiltonian …

The connectivity is an important measurement for the fault-tolerance of networks. The
structure connectivity and substructure connectivity are two generalizations of the classical …