سال انتشار: ۱۳۸۶

محل انتشار: سی و هشتمین کنفرانس ریاضی ایران

تعداد صفحات: ۳

نویسنده(ها):

E.S MAHMOODIAN – Institute for Studies in Theoretical Physics and Mathematics (IPM) and Sharif University of Thechnology. Tehtan. Iran
F.S MOUSAVI – IPM and Department of Mathematics, Institute for Advenced Studies in Basic Sciences (IASBS) Znjan, Iran

چکیده:

In a graph G a vertex v dominates itself and its neighborhood. A domatic partition in a graph G is a partition of V (G) into pairwise disjoint dominating sets. The domatic number d(G) of G is the maximum cardinality of a domatic partition of G. A generalized Petersen graph, denoted by P(n,k), is obtained by letting is vertex set be {u1, …, un} レ{v1, …, vn} and its edge set be {uiui+1, uivi, vivi+1}; where i=1, …, n and subscripts are reduced modulo n. In this talk forst we characterize generalized Petersen graphs with maximum domatic number 4, then we study domatic number of P(n,k) for kΞ۰ (mod3) or nΞ۰ (mod3).
Also we determine domatic number of P(n,k) for 3lk ≤ n ≤ ۳l (k+1) and P(n,1).