Abstract We study the rheological behaviour of a dense bidispersed suspension varying relative size two dispersed phases. The main outcome our analysis is that an enhanced flowability (reduced viscosity) can be achieved by increasing dispersion ratio explain observed result showing presence large particles increases packing efficiency suspension, leading to reduction contribution contacts on ov...

Tetrahedra are special among the platonic solids. They are the simplest polyhedra and the ones most unlike spheres. Surprisingly, much of our knowledge about the packing properties of tetrahedra is very recent: the past year has witnessed a sudden proliferation of novel, and often surprising, findings. Using Monte Carlo simulations, Haji-Akbari et al.[1] found that, upon compression, systems of...

The exclusive use of very small grafts has moved from the experimental to the forefront. Dense packing of minigrafts of 1.5 mm or less in combination with one-or two-haired grafts offers the appearance of comparable density and undetectability, while using donor hair very efficiently. The use of smaller grafts in greater quantity offers many advantages normally unavailable with traditional larg...

If r 1, and m and n are each a multiple of (r + 1)2 + r2, then each isomorphic component of Cm ×Cn admits of a vertex partition into (r + 1)2 + r2 perfect r-dominating sets. The result induces a dense packing of Cm × Cn by means of vertexdisjoint subgraphs, each isomorphic to a diagonal array. Areas of applications include efficient resource placement in a diagonal mesh and error-correcting cod...

We provide, for any r∈(0,1), lower and upper bounds on the maximal density of a packing in Euclidean plane discs radius 1 r. The are mostly folk, but improve best previously known ones r∈[0.11,0.74]. For many values r, this gives fairly good idea exact maximum density. In particular, we get new intervals r which does not allow more dense that hexagonal equal discs.

in a graph g = (v,e), a subset s  v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex u is represented by a geometric object R(u) and each edge (u, v) is represented by the intersection between R(u) and R(v), if it belongs to a dense subgraph, or by a curve connecting the boundaries ofR(u) andR(v), otherwise. We study a notion of plana...

Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Di...

We present experimental measurements of dynamical heterogeneities in a dense system of microgel spheres, sheared at different rates and at different packing fractions in a microfluidic channel, and visualized with high-speed digital video microscopy. A four-point dynamic susceptibility is deduced from video correlations, and is found to exhibit a peak that grows in height and shifts to longer t...