Domatic number of graph products

• Autorzy: Kijewska M.
• Języki publikacji: EN

Abstrakty

EN

A partition of V(G), all of whose classes arę dominating sets in G, is called a domatic partition of G. The maximum number of classes of a domatic partition of G is called the domatic nuraber of G. In this paper we explore the bounds for the domatic numbers of the cartesian product, the strong product and the join of two graphs. The bounds are the best possible in the sense that there exist examples for which equalities are attained.

Słowa kluczowe

EN

domatic number; graph products

PL

iloczyn grafów; iloczyn kartezjański

• Wydawca: Oficyna Wydawnicza Politechniki Rzeszowskiej
• Czasopismo: Journal of Mathematics and Applications
• Rocznik: 2008
• Tom: Vol. 30
• Strony: 71--81
• Opis fizyczny: Bibliogr. 7 poz.

Twórcy

autor

Kijewska M.

• Institute of Mathematics, Physics and Chemistry Department of Mathematics Maritime University of Szczecin St. Wały Chrobrego 1/2, 70-500 Szczecin, Poland,

Bibliografia

• [1] C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
• [2] G.J. Chang, The domatic number problem, Discrete Mathematics 125 (1994) 115-122.
• [3] E.J. Cockayne, S.T. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977) 247-261.
• [4] E.J. Cockayne, Domination of undirected graphs - a survey. In: Theory and Applications of Graphs, Proc. Michigan 1976, ed. By Y.Alavi and D, R. Lick (Springer - Verlag Berlin-Heidelberg-New York 1978) 141-147.
• [5] R. Diestel, Graph Theory, Springer-Verlang (1996).
• [6] T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundaments of domination in graphs, New York, Basel, Hong Kong, Marcel Dekker, Inc. (1998).
• [7] B. Zelinka, Domatically critical graphs, Czech. Math. J. 30 (1980) 468-489.