Open packing bondage number of a graph
2019 ◽
Vol 11
(05)
◽
pp. 1950051
In a graph [Formula: see text], a 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]. The open packing bondage number of a graph [Formula: see text], denoted by [Formula: see text], is the cardinality of the smallest set of edges [Formula: see text] such that [Formula: see text]. In this paper, we initiate a study on this parameter.
2016 ◽
Vol 08
(01)
◽
pp. 1650016
◽
2020 ◽
Vol 8
(4S4)
◽
pp. 97-100
Keyword(s):
Keyword(s):
2016 ◽
Vol 10
(02)
◽
pp. 1750033
1998 ◽
Vol 21
(3-4)
◽
pp. 235-245
◽