On Open Packing Number of Graphs

Author(s):

I. Sahul Hamid , S. Saravanakumar

Abstract:
In a graph G = (V,E), a subset S  V is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. This paper further studies on this parameter by obtaining some new bounds.
Keywords:

Open packing , Maximum degree , Clique , Split graphs

Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:12 Issue: 1, May 2017
Pages:
107 to 117
https://www.magiran.com/p1674662