Abstract
In a graph [Formula: see text], a non-empty 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] Let [Formula: see text] and let [Formula: see text] denote the maximum cardinality of an open packing set in [Formula: see text] which contains [Formula: see text]. Then [Formula: see text] is called the open packing saturation number of [Formula: see text]. In this paper, we initiate a study on this parameter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
