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.

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.

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and ...

In a graph G = ( V , E ), two edges e 1 and 2 are said to have common edge if there exists an ∈ ) different from such that joins vertex of in . That is, 〈 〉 is either P 4 or K 3 A non-empty set D ⊆ open packing no The maximum cardinality the number denoted by ρ o ). this paper, we initiate study on parameter.

We consider the Ordered Open End Bin Packing problem. Items of sizes in (0, 1] are presented one by one, to be assigned bins this order. An item can any bin for which current total size is strictly below 1. This means also that overloaded its last packed item. improve lower and upper bounds on asymptotic competitive ratio online case. Specifically, we design first algorithm whose 2, value close...