Total limited packing in graphs

• Autorzy: Hosseini Moghaddam S. M. , Mojdeh D. A. , Samadi B.

Identyfikatory

DOI

10.1515/fascmath-2016-0008

• Języki publikacji: EN

Abstrakty

EN

We define a k-total limited packing number in a graph, which generalizes the concept of open packing number in graphs, and give several bounds on it. These bounds involve many well known parameters of graphs. Also, we establish a connection among the concepts of tuple domination, tuple total domination and total limited packing that implies some results.

Słowa kluczowe

EN

k-total limited packing; k-tuple domination; k-tuple total domination

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Fasciculi Mathematici
• Rocznik: 2016
• Tom: Nr 56
• Strony: 121--127
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Hosseini Moghaddam S. M.

• Islamic Azad University, Qom Branch, Qom, Iran

autor

Mojdeh D. A.

• Department of Mathematics, University of Mazandaran, Babolsar, Iran

autor

Samadi B.

• Department of Mathematics, Arak University, Arak, Iran

Bibliografia

• [1] Archdeacon D., Ellis-Monaghan J., Fischer D., Froncek D., Lam P.C.B., Seager S., Wei B., Yuster R., Some remarks on domination, J. Graph Theory, 46(2004), 207-210.
• [2] Gallant R., Gunther G., Hartnell B., Rall D.F., Limited packings in graphs, Discrete Appl. Math., 158(2010), 1357-1364.
• [3] Harrary F., Haynes T.W., Double domination in graphs, Ars Combin., 55(2000), 201-213.
• [4] Haynes T.W., Hedetniemi S.T., Slater P.J., Domination in Graphs: Advanced Topics, New York, Marcel Dekker, 1998.
• [5] Haynes T.W., Hedetniemi S.T., Slater P.J., Fundamentals of Domination in Graphs, New York, Marcel Dekker, 1998.
• [6] Henning M.A., Kazemi A.P., k-tuple total domination in cross products of graphs, J. Comb. Optim., 24(2010), 339-346.
• [7] Henning M., Kazemi A.P., k-tuple total domination in graphs, Discrete Appl. Math., 158(2010), 1006-1011.
• [8] Hamid S., Saravanakumar S., Packing parameters in graphs, Discuss Math., Graph Theory, 35(2015), 1-11.
• [9] Henning H., Slater P.J., Open packing in Graphs, J. Combin. Math. Combin. Compu., 28(1999), 5-18.
• [10] Mojdeh D.A., Samadi B., Hosseini Moghaddam S.M., Limited packing vs tuple domination in graphs, Ars Combin, (to appear).
• [11] West D.B., Introduction to graph theory (Second Edition), Prentice Hall, USA, 2001.
• [12] Zhao W., Wang H., Xu G., Total k-domination number in graphs, Int. J. Pure Appl. Math., 35(2007), 235-242.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.