Outer-connected open packing sets in graphs
A set [Formula: see text] of a graph [Formula: see text] is an [Formula: see text] [Formula: see text] [Formula: see text] of [Formula: see text] if no two vertices of [Formula: see text] have a common neighbor in [Formula: see text]. An open packing set [Formula: see text] is called an outer-connected open packing set (ocop-set) if either [Formula: see text] or [Formula: see text] is connected. The minimum and maximum cardinalities of an ocop-set are called the lower outer-connected open packing number and the outer-connected open packing number, respectively, and are denoted by [Formula: see text] and [Formula: see text], respectively. In this paper, we initiate a study on these parameters.
2019 ◽
Vol 11
(05)
◽
pp. 1950051
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
◽