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.
关键词
强乘积图/笛卡尔乘积图/集边控制数
Key words
strong product graphs/Cartesian product graphs/edge domatic number
万方数据