Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
Packing Parameters in Graphs
oleh: Sahul Hamid I., Saravanakumar S.
Format: | Article |
---|---|
Diterbitkan: | University of Zielona Góra 2015-02-01 |
Deskripsi
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 are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters.