Let G(n,α) be the class of block graphs on n vertices and prescribed independence number α. In this article we prove that the maximum spectral radius ρ(G), among all graphs G∈G(n,α), is reached at a unique graph. As a ...

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss ...

With the fast innovation of the hardware and software technologies using rapid prototyping devices, with application in the robotics and automation, more and more it becomes necessary the development of applications based ...

With the fast innovation of the hardware and software technologies using rapid prototyping devices, with application in the robotics and automation, more and more it becomes necessary the development of applications based ...

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss ...

Thirty-four years ago Everett [The Solid-Gas Interface, Vol. 2, Marcel Dekker, New York, 1967, p. 1055] proposed a pore-blocking factor when establishing the foundations of a non-independent domain theory (IDT) of sorption ...