|
|
|
|
on domatic number of graphs
|
|
|
|
|
|
|
|
نویسنده
|
borzooei rajab ali ,shadravan mehrnoosh
|
|
منبع
|
journal of mathematical extension - 2023 - دوره : 17 - شماره : 8 - صفحه:1 -15
|
|
چکیده
|
The domatic number d(g) of a graph g is the maximum k for which v (g) can be partitioned into k pairwise disjoint dominating sets. in this paper, we determine the domatic numbers of complete graphs, complete k-partite graphs, johnson graphs j(n, 2), unicyclic graphs, bicyclic graphs and generalized θ-graphs.
|
|
کلیدواژه
|
domatic number ,vertex coloring ,coupon coloring
|
|
آدرس
|
shahid beheshti university, faculty of science, department of mathematics, iran, shahid beheshti university, faculty of science, department of mathematics, iran
|
|
پست الکترونیکی
|
shadravan@sbu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|