Browse > Article
http://dx.doi.org/10.5666/KMJ.2016.56.3.745

Effect of Open Packing upon Vertex Removal  

Hamid, Ismail Sahul (Department of Mathematics, The Madura College)
Saravanakumar, Soundararajan (Department of Mathematics, The Madura College)
Publication Information
Kyungpook Mathematical Journal / v.56, no.3, 2016 , pp. 745-754 More about this Journal
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
Packing number; open packing number;
Citations & Related Records
연도 인용수 순위
  • Reference
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.   DOI
5 I. Sahul Hamid, S. Saravanakumar, Packing parameters in graphs, Discussiones Mathematicae Graph theory, 35(2015), 5-16.   DOI