Changing and unchanging Open Packing: Edge removal
I. Sahul Hamid, S. Saravanakumar · Discrete Mathematics Algorithms and Applications · 2015
In a graph [Formula: see text], a nonempty set [Formula: see text] is said to be an open packing set if no two vertices of [Formula: see text] have a common neighbor in [Formula: see text] The maximum cardinality of an open packing set is called the open packing number and is denoted by [Formula: see text]. In this paper, we examine the effect of [Formula: see text] when [Formula: see text] is modified by deleting an edge.