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 $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.

Sustainable development is a global goal that entails an interdisciplinary approach for tackling ongoing and future challenges regarding the environment, climate change, economic limitations, resource efficiency. Against this background, valorizing available high-potential waste to manufacture value-added products facilitate recycling resources energy meets significant objectives of circular ec...

Packing materials used in biofiltration of gaseous pollutants represent a key design parameter, as proper selection might not only determine the adequate performance system but also its cost-effectiveness. This study systematically assessed and compared conventional plastic carrier with that two novel clay-based from SAINT GOBAIN for abatement model odorous stream composed H2S, methylmercaptan ...