ﺑﺴﺘﻪﺑﻨﺪی ﻫﺎی ﺑﺎز در درﺧﺖ ﻫﺎ

Subject Areas : Statistics

Mehdi Mohammadi ¹ , Mohammad Maghasedi ²

1 -
2 -

Received: 2017-10-14 Accepted : 2018-12-26 Published : 2024-01-18

Keywords:

References:

[1] G. Chartrand and L. Lesniak (2005). Graphs and Digraphs, Fourth Edition, Boca Raton: CRC Press.

[2] E. Gyori, A. Kostochka, A. McConveyd and D. Yager (2016). A list version of graph packing, Discrete Math., 339, 2178-2185.

[3] I.S. Hamid and S. Saravanakumar (2015). Packing parameters in graphs, Discuss. Math. Graph Theory, 35, 5-16.

[4] M. A. Henning and A. Yeo(2013). Total domination, Springer-Verlag New York, New York.

[5] A. Zak (2014). On packing two graphs with bounded sum of size and maximum degree, SIAM J. Discrete Math. 28, 1686-1698.

[6] D. B. West (2001). Introduction to graph theory, 2nd Edition, Prentice-Hall.

[7] M.A. Henning, P.J. Slater (1999). Open packing in graphs, J. Comb. Math. Comb. Comput, 29, 3-16.

[8] M. A. Henning (1998). Packing in trees, Discrete Math. ,186, 145-155.

[9] N. Biggs (1973). Perfect codes in graphs, J. Combin Theory (B), 15, 289-296.