No Access

Open packing saturation number of a graph

I. Sahul Hamid

Department of Mathematics, The Madura College (Autonomous), Madurai 625 011, India

E-mail Address: sahulmat@yahoo.co.in

Search for more papers by this author

and

S. Saravanakumar

Department of Mathematics, Kalasalingam University, Krishnankoil 626 126, India

E-mail Address: alg.ssk@gmail.com

Corresponding author.

Search for more papers by this author

https://doi.org/10.1142/S1793557117500334Cited by:0 (Source: Crossref)

Abstract

In a graph $G = (V, E)$ , a non-empty set $S \subseteq V (G)$ is said to be an open packing set if no two vertices of $S$ have a common neighbor in $G .$ Let $v \in V$ and let $O S (v)$ denote the maximum cardinality of an open packing set in $G$ which contains $v$ . Then $O S (G) = min {O S (v) : v \in V}$ is called the open packing saturation number of $G$ . In this paper, we initiate a study on this parameter.

Communicated by S. Klavcar

Keywords:

AMSC: 05C70

References

1. B. D. Acharya , The strong domination number of a graph and related concepts, J. Math. Phys. Sci. 14(5) (1980) 471–475. Google Scholar
2. S. Arumugam, O. Favaron and S. Sudha , Irredundance saturation number of a graph, Australas. J. Combin. 46 (2010) 37–49. Google Scholar
3. S. Arumugam and R. Kala , Domsaturation number of a graph, Indian J. Pure. Appl. Math. 33(11) (2002) 1671–1676. Web of Science, Google Scholar
4. S. Arumugam and M. Subramanian , Independence saturation and extended domination chain in graphs, AKCE J. Graph. Combin. 4(2) (2007) 59–69. Google Scholar
5. G. Chartrand and Lesniak , Graphs and Digraphs, 4th edn. (CRC Press, Boca Raton, 2005). Google Scholar
6. M. A. Henning , Upper bounds on the lower open packing number of a tree, Quaest. Math. 21 (1998) 235–245. Crossref, Google Scholar
7. M. A. Henning and P. J. Slater , Open packing in graphs, J. Combin. Math. Combin. Comput. 29 (1999) 3–16. Google Scholar
8. A. Meir and J. W. Moon , Relations between packing and covering numbers of a tree, Pacific J. Math. 61 (1975) 225–233. Crossref, Web of Science, Google Scholar
9. I. Sahul Hamid and S. Saravanakumar , Packing parameters in graphs, Discussi. Math. Graph Theory 35 (2015) 5–16. Crossref, Web of Science, Google Scholar
10. I. Sahul Hamid and S. Saravanakumar , On open packing number of graphs, Iran. J. Math. Sci. Inform., Accepted for publication. Google Scholar