The Edge Domatic Number of Two Kinds of Product Graphs
The edge domatic number of graphs is an important parameter for studying the partition problem of edge dominating sets in graphs.By the method of classification discussion,the edge domatic numbers of two kinds of product graphs are studied,and the edge domatic numbers of the strong product graphs Pm⊗Pn(m≥2,n≥3)and the Cartesian product graphs P2×Cn are determined respectively.
strong product graphsCartesian product graphsedge domatic number
万方数据
