Meilian Liang

Upper bounds on the connection probability for 2-D meshes and tori

Mesh is an important and popular interconnection network topology for large parallel computer systems. A mesh can be divided into submeshes to obtain the upper bounds on the connection probability for the mesh. Combinatorial techniques are used to get closer upper bounds on the connection probability for 2-D meshes compared with the existing upper bounds we have known. Simulation results of meshes of various sizes show that our upper bounds are close to the exact connection probability. The combinatorial methods and tools used in this paper can be used to study the connection probabilities for other networks.

New Lower Bounds for Two Multicolor Vertex Folkman Numbers

For a graph

Edge rough graph and its application

G

Lower Bounds on the Connectivity Probability for 2-D Mesh Networks

,

New optimal modular Sidon sets

G\rightarrow (a_1, a_2, \cdots, a_r)^v

Estimating the Connection Probability for 2-D Mesh Networks by Monte Carlo Methods

means that in every

On rainbow domination numbers of graphs

r

On sets without k-term arithmetic progression

-coloring of the vertices in

Upper bounds for the vertex Folkman number F v (3, 3, 3;4) and F v (3, 3, 3;5).

G

Some New Golomb Rectangles

, there exists a monochromatic