Kyungpook Mathematical Journal

Department of Mathematics, Kyungpook National University (경북대학교 자연과학대학 수학과)
권호 표지
DOI QR코드

DOI QR Code

Effect of Open Packing upon Vertex Removal

  • Received : 2015.11.27
  • Accepted : 2016.05.11
  • Published : 2016.09.23
Download PDF
⟨ Previous Next ⟩

Abstract

In a graph G = (V, E), a non-empty set $S{\subseteq}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}^{\circ}$. In this paper, we examine the effect of ${\rho}^{\circ}$ when G is modified by deleting a vertex.

Keywords

References

  1. G. Chartrand and Lesniak, Graphs and Digraphs, Fourth edition, CRC press, Boca Raton, 2005.
  2. T. W. Haynes, S. T. Hedetniemi, P. J. Slater, Fundamentals of domination in Graphs, Marcel Dekker, Newyork(1998).
  3. M. A. Henning, P. J. Slater, Open packing in graphs, JCMCC, 29(1999), 3-16.
  4. M. A. Henning, Upper bounds on the lower open packing number of a tree, Quaestiones Mathematicae, 21(1998), 235-245. https://doi.org/10.1080/16073606.1998.9632043
  5. I. Sahul Hamid, S. Saravanakumar, Packing parameters in graphs, Discussiones Mathematicae Graph theory, 35(2015), 5-16. https://doi.org/10.7151/dmgt.1775