Science and technology of rubber reclamation with special attention to NR-based waste latex products

A comprehensive overview of reclamation of cured rubber with special emphasis on latex reclamation is depicted in this paper. The latex industry has expanded over the years to meet the world demands for gloves, condoms, latex thread, etc. Due to the strict specifications for the products and the unstable nature of the latex as high as 15% of the final latex products are rejected. As waste latex rubber (WLR) represents a source of high-quality rubber hydrocarbon, it is a potential candidate for generating reclaimed rubber of superior quality. The role of the different components in the reclamation recipe is explained and the reaction mechanism and chemistry during reclamation are discussed in detail. Different types of reclaiming processes are described with special reference to processes, which selectively cleave the cross links in the vulcanized rubber. The state-of-the-art techniques of reclamation with special attention on latex treatment are reviewed. An overview of the latest development concerning the fundamental studies in the field of rubber recycling by means of low-molecular weight compounds is described. A mathematical model description of main-chain and crosslink scission during devulcanization of a rubber vulcanizate is also given.

On the generalized obnoxious center problem: antimedian subsets

The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered.

On The Center Sets and Center Numbers of Some Graph Classes

For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes